On the complexity of the separation problem for rounded capacity inequalities
type: Item
instance of: scholarly article
title: On the complexity of the separation problem for rounded capacity inequalities
zbMATH Open document ID: 1387.90278
author: I. Diarrassouba
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6872139
zbMATH Keywords: branch-and-cut
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: computational complexity
zbMATH Keywords: capacitated vehicle routing problem
describes a project that uses: VRP
describes a project that uses: CVRPSP
MaRDI profile type: Publication
full work available at URL: j.disopt.2017.02.003
OpenAlex ID: W2598440989
cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
cites work: Q3523238
cites work: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
cites work: The vehicle routing problem
cites work: Vehicle Routing
cites work: Polyhedral study of the capacitated vehicle routing problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: On the capacitated vehicle routing problem
cites work: Q4254875
cites work: Separating capacity constraints in the CVRP using tabu search
cites work: Easy and difficult objective functions for max cut
cites work: Q4532225
cites work: The separation problem of rounded capacity inequalities: some polynomial cases
cites work: Q4198056
cites work: A construction for binary matroids
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Two node-disjoint hop-constrained survivable network design and polyhedra
DOI: 10.1016/J.DISOPT.2017.02.003
Recommended article: The separation problem of rounded capacity inequalities: some polynomial cases
Recommended article: The complexity of cover inequality separation
Recommended article: Q4583056
Recommended article: On the complexity of separation from the knapsack polytope
Recommended article: On the complexity of polyhedral separability
Recommended article: Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
Recommended article: Set separation, approximating multicones, and the Lipschitz maximum principle
Recommended article: Separation of convex cones and extremal problems
Recommended article: Q5480796
Recommended article: On the separation of split cuts and related inequalities
description: scientific article; zbMATH DE number 6872139