The separation problem of rounded capacity inequalities: some polynomial cases

DOI10.1016/J.DISOPT.2016.11.005MaRDI QIDQ1751206zbMATH OpenOpenAlexFDO

Authors I. Diarrassouba

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

zbMATH Keywords

capacitated vehicle routing problempolynomial separation algorithmrounded capacity inequalitiessubmodular function

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Integer programming (90C10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the complexity of the separation problem for rounded capacity inequalities
• Polynomial-time separation of enhanced reverse multistar inequalities
• On the capacitated vehicle routing problem
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
• Separating capacity constraints in the CVRP using tabu search

Cites work

• A branch-and-cut for the Non-Disjointm-Ring-Star Problem
• A new approach to the maximum-flow problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• Easy and difficult objective functions for max cut
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1749222 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• Minimizing submodular functions over families of sets
• On the capacitated vehicle routing problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Separating capacity constraints in the CVRP using tabu search
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• Submodular function minimization
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• The vehicle routing problem
• Two node-disjoint hop-constrained survivable network design and polyhedra
• Vehicle Routing

Cited in

(3)

• On the complexity of the separation problem for rounded capacity inequalities
• Polynomial-time separation of enhanced reverse multistar inequalities
• Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem

Describes a project that uses

Uses Software

• CVRPSP
• VRP

This page was built for publication: The separation problem of rounded capacity inequalities: some polynomial cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751206)