Unsplittable non-additive capacitated network design using set functions polyhedra

DOI10.1016/J.COR.2015.08.009MaRDI QIDQ342169zbMATH OpenOpenAlexFDO

Authors Amal Benhamiche, Nancy Perrot, Eduardo Uchoa, A. R. 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

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

Recommendations

• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• On capacitated network design cut-set polyhedra
• On cut-based inequalities for capacitated network design polyhedra
• Network design arc set with variable upper bounds

Cites work

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

Cited in

(8)

• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
• Express shipment service network design with complex routes
• Models for the piecewise linear unsplittable multicommodity flow problems
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Mathematical formulations for multi-period network design with modular capacity adjustments
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• A characterization of the uncapacitated network design polytope
• Benders decomposition for capacitated network design

This page was built for publication: Unsplittable non-additive capacitated network design using set functions polyhedra

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