Projections of the capacitated network loading problem
From MaRDI portal
Publication:1577107
DOI10.1016/S0377-2217(99)00083-1zbMath0961.90013MaRDI QIDQ1577107
Publication date: 30 August 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00083-1
Related Items
A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, 0-1 reformulations of the multicommodity capacitated network design problem, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, The single-vehicle two-echelon one-commodity pickup and delivery problem, A note on capacity models for network design, The multi-commodity pickup-and-delivery traveling salesman problem, Projecting the flow variables for hub location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convex hull of two core capacitated network design problems
- The perfectly matchable subgraph polytope of an arbitrary graph
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Strong formulations for mixed integer programming: A survey
- Multicommodity flows in planar graphs
- Matroids and multicommodity flows
- The Steiner tree polytope and related polyhedra
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- The perfectly matchable subgraph polytope of a bipartite graph
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Four-terminus flows
- The path set polytope of an acyclic, directed graph with an application to machine sequencing
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Multi-Commodity Network Flows
