On splittable and unsplittable flow capacitated network design arc-set polyhedra.

DOI10.1007/S101070100269zbMath1094.90005OpenAlexW2132324770MaRDI QIDQ1611009

Deepak Rajan, Atamtürk, Alper

Publication date: 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100269

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (35)

On the complexity of sequentially lifting cover inequalities for the knapsack polytope ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Optimization in telecommunication networks ⋮ A stabilized structured Dantzig-Wolfe decomposition method ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Revisiting Lagrangian relaxation for network design ⋮ A note on capacity models for network design ⋮ Integer programming solution approach for inventory‐production–distribution problems with direct shipments ⋮ Mathematical formulations for multi-period network design with modular capacity adjustments ⋮ Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Benders, metric and cutset inequalities for multicommodity capacitated network design ⋮ Bidirected and unidirected capacity installation in telecommunication networks. ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ Compact formulations as a union of polyhedra ⋮ The splittable flow arc set with capacity and minimum load constraints ⋮ A Branch and Price algorithm for the \(k\)-splittable maximum flow problem ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Metric inequalities and the network loading problem ⋮ Generalized coefficient strengthening cuts for mixed integer programming ⋮ Branch-and-price-and-cut for a service network design and hub location problem ⋮ Models for the piecewise linear unsplittable multicommodity flow problems ⋮ Optimizing over the split closure ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Algorithms for the non-bifurcated network design problem ⋮ k -Splittable delay constrained routing problem: A branch-and-price approach ⋮ The continuous knapsack set ⋮ SCIP: solving constraint integer programs ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut ⋮ On cut-based inequalities for capacitated network design polyhedra ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Cover and pack inequalities for (mixed) integer programming ⋮ Continuous knapsack sets with divisible capacities

This page was built for publication: On splittable and unsplittable flow capacitated network design arc-set polyhedra.