Shortest paths, single origin‐destination network design, and associated polyhedra
From MaRDI portal
Publication:5287444
DOI10.1002/net.3230230205zbMath0791.90064OpenAlexW2087132085MaRDI QIDQ5287444
Prakash Mirchandani, Thomas L. Magnanti
Publication date: 5 September 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230205
shortest pathnetwork designtelecommunicationsundirected networkthree types of capacitated facilitiesthree-facility loading
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items
On dependent randomized rounding algorithms, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Polyhedral results on single node variable upper-bound flow models with allowed configurations, Robust network design: Formulations, valid inequalities, and computations, Source sink flows with capacity installation in batches, A suboptimal solution to a hierarchical network design problem using dynamic programming, A note on capacity models for network design, Valid inequalities and facets for multi‐module survivable network design problem, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Algorithms and extended formulations for one and two facility network design, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, A survey on Benders decomposition applied to fixed-charge network design problems, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Polyhedral structure of the 4-node network design problem, On cut-based inequalities for capacitated network design polyhedra, 0-1 reformulations of the multicommodity capacitated network design problem, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems, Cutting planes for integer programs with general integer variables, Projections of the capacitated network loading problem, Optimal placement of add/drop multiplexers: Static and dynamic models, Diversification strategies in local search for a nonbifurcated network loading problem, Exact solution of multicommodity network optimization problems with general step cost functions, Cover and pack inequalities for (mixed) integer programming
Cites Work
