On the complexity of the separation problem for rounded capacity inequalities
From MaRDI portal
Publication:1751233
DOI10.1016/j.disopt.2017.02.003zbMath1387.90278OpenAlexW2598440989MaRDI QIDQ1751233
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.2017.02.003
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics, Preprocessing to reduce vehicle capacity for routing problems, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, Improving the approximation ratio for capacitated vehicle routing, A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
Uses Software
Cites Work
- Unnamed Item
- 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
- Polyhedral study of the capacitated vehicle routing problem
- A construction for binary matroids
- On the capacitated vehicle routing problem
- Easy and difficult objective functions for max cut
- Separating capacity constraints in the CVRP using tabu search
- The separation problem of rounded capacity inequalities: some polynomial cases
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- The Vehicle Routing Problem
- Vehicle Routing
- Odd Minimum Cut-Sets and b-Matchings
- Two node-disjoint hop-constrained survivable network design and polyhedra
