Investigation of some branch and bound strategies for the solution of mixed integer linear programs
Mathematical Programming1973Vol. 4(1), pp. 155–170
Citations Over TimeTop 10% of 1973 papers
Related Papers
- → A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs(2008)143 cited
- → A practicable branch-and-bound algorithm for globally solving linear multiplicative programming(2017)42 cited
- → Branching approaches for integrated vehicle and crew scheduling(2008)40 cited
- → A dynamic programming branch and bound algorithm for pure integer programming(1976)9 cited
- → Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation: LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: ALGEBRAIC METHODS(2001)1 cited