Separating tight metric inequalities by bilevel programming

DOI10.1016/j.orl.2012.09.009zbMath1258.90099OpenAlexW1987357293MaRDI QIDQ1939716

Sara Mattia

Publication date: 5 March 2013

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.09.009

zbMATH Keywords

cutting planesnetwork designcapacity formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (9)

The robust network loading problem with dynamic routing ⋮ Energy-aware survivable networks ⋮ Network loading problem: valid inequalities from 5- and higher partitions ⋮ A polyhedral study of the capacity formulation of the multilayer network design problem ⋮ Bilevel programming and the separation problem ⋮ Fixed charge multicommodity network design using \(p\)-partition facets ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ Benders Decomposition for Capacitated Network Design ⋮ An exact approach for the multicommodity network optimization problem with a step cost function

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Solving survivable two-layer network design problems by metric inequalities
• The convex hull of two core capacitated network design problems
• Bilevel programming: a survey
• An improved Benders decomposition applied to a multi-layer network design problem
• Minimum cost capacity installation for multicommodity network flows
• A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
• A branch-and-cut algorithm for capacitated network design problems
• Diversification strategies in local search for a nonbifurcated network loading problem
• On capacitated network design cut-set polyhedra
• Metric inequalities and the network loading problem
• On cut-based inequalities for capacitated network design polyhedra
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• k-Partition-based facets of the network design problem

This page was built for publication: Separating tight metric inequalities by bilevel programming