The separation problem of rounded capacity inequalities: some polynomial cases
Publication:1751206
DOI10.1016/J.DISOPT.2016.11.005zbMath1387.90261OpenAlexW2566858588MaRDI QIDQ1751206
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.11.005
submodular functioncapacitated vehicle routing problempolynomial separation algorithmrounded capacity inequalities
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- On the capacitated vehicle routing problem
- Easy and difficult objective functions for max cut
- Separating capacity constraints in the CVRP using tabu search
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Minimizing submodular functions over families of sets
- The Vehicle Routing Problem
- Vehicle Routing
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- A new approach to the maximum-flow problem
- Two node-disjoint hop-constrained survivable network design and polyhedra
- A branch-and-cut for the Non-Disjointm-Ring-Star Problem
- Integer Programming and Combinatorial Optimization
This page was built for publication: The separation problem of rounded capacity inequalities: some polynomial cases
