Decomposition and dynamic cut generation in integer linear programming
From MaRDI portal
Publication:2490337
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1349588 (Why is no real title available?)
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- 2-path cuts for the vehicle routing problem with time windows
- A Lagrangian relaxation approach to the edge-weighted clique problem
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A restricted Lagrangean approach to the traveling salesman problem
- Algorithms for the set covering problem
- An Algorithm for the Three-Index Assignment Problem
- An SST-based algorithm for the steiner problem in graphs
- Branch-and-price: Column generation for solving huge integer programs
- Combining Column Generation and Lagrangian Relaxation
- Decomposition Principle for Linear Programs
- Decomposition in integer linear programming
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Facets of the three-index assignment polytope
- Lagrangean heuristics for location problems
- Lagrangean relaxation. (With comments and rejoinder).
- Linear-time separation algorithms for the three-index assignment polytope
- Lot-sizing with start-up times
- Network flows. Theory, algorithms, and applications.
- On constrained optimization by adjoint based quasi-Newton methods
- On the capacitated vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Optimal rectangular partitions
- Plant location with minimum inventory
- Polyhedral techniques in combinatorial optimization I: Theory
- Selected Topics in Column Generation
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Steiner tree polytope and related polyhedra
- The ellipsoid method and its consequences in combinatorial optimization
- The truck dispatching problem
- The volume algorithm: Producing primal solutions with a subgradient method
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Tree polytope on 2-trees
Cited in
(10)- Testing cut generators for mixed-integer linear programming
- Decomposition in integer linear programming
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Decomposition methods for global solution of mixed-integer linear programs
- scientific article; zbMATH DE number 1216241 (Why is no real title available?)
- Non delayed relax-and-cut algorithms
- Decomposition, reformulation, and diving in university course timetabling
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
This page was built for publication: Decomposition and dynamic cut generation in integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490337)
