Mixed integer programming models for dispatching vehicles at a container terminal
Journal of Applied Mathematics and Computing2005Vol. 17(1-2), pp. 145–170
Citations Over TimeTop 22% of 2005 papers
Related Papers
- → A parallel integer linear programming algorithm(1988)30 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
- → Decomposition techniques for MILP: Lagrangian relaxation; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming: Lagrangian relaxation; Simplicial pivoting algorithms for integer programming; Time-dependent traveling salesman problem INTEGER PROGRAMMING DUALITY(2001)