Separating tight metric inequalities by bilevel programming
From MaRDI portal
(Redirected from Publication:1939716)
Recommendations
- Bilevel programming and the separation problem
- New optimality conditions for bilevel programs by using an exact separation principle
- scientific article; zbMATH DE number 1559437
- Bounding duality gap for separable problems with linear constraints
- Bilevel programs: approximation results involving reverse convex programs
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- scientific article; zbMATH DE number 1382559
- Bilevel optimization problems in topological spaces
- Bilevel polynomial programs and semidefinite relaxation methods
Cites work
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A branch-and-cut algorithm for capacitated network design problems
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- An improved Benders decomposition applied to a multi-layer network design problem
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel programming: a survey
- Diversification strategies in local search for a nonbifurcated network loading 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
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- Solving survivable two-layer network design problems by metric inequalities
- The convex hull of two core capacitated network design problems
- k-Partition-based facets of the network design problem
Cited in
(11)- Bilevel programming and the separation problem
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Network loading problem: valid inequalities from 5- and higher partitions
- Energy-aware survivable networks
- A polyhedral study of the capacity formulation of the multilayer network design problem
- The robust network loading problem with dynamic routing
- An exact approach for the multicommodity network optimization problem with a step cost function
- Fixed charge multicommodity network design using p-partition facets
- Metric inequalities and the network loading problem
- Benders decomposition for capacitated network design
- Integer Programming and Combinatorial Optimization
This page was built for publication: Separating tight metric inequalities by bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939716)
