Unsplittable non-additive capacitated network design using set functions polyhedra

DOI10.1016/j.cor.2015.08.009zbMath1349.90157OpenAlexW1423374381MaRDI QIDQ342169

Amal Benhamiche, Nancy Perrot, Eduardo Uchoa, Ali Ridha Mahjoub

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.08.009

zbMATH Keywords

polyhedrabranch-and-cutset functionscapacitated network design

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Mathematical formulations for multi-period network design with modular capacity adjustments, Models for the piecewise linear unsplittable multicommodity flow problems, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron, Benders Decomposition for Capacitated Network Design, Express shipment service network design with complex routes

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of dual-feasible and superadditive functions
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• The convex hull of two core capacitated network design problems
• Lower bounds and reduction procedures for the bin packing problem
• 0-1 reformulations of the multicommodity capacitated network design problem
• An improved Benders decomposition applied to a multi-layer network design problem
• Partitioning procedures for solving mixed-variables programming problems
• Minimum cost capacity installation for multicommodity network flows
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Polyhedral results for the edge capacity polytope.
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• On capacitated network design cut-set polyhedra
• Metric inequalities and the network loading problem
• On cut-based inequalities for capacitated network design polyhedra
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• Routing Through Virtual Paths in Layered Telecommunication Networks
• A polyhedral study of the capacity formulation of the multilayer network design problem
• Capacitated Network Design—Polyhedral Structure and Computation
• Strong inequalities for capacitated survivable network design problems.
• New classes of fast lower bounds for bin packing problems