Separating tight metric inequalities by bilevel programming
type: Item
instance of: scholarly article
title: Separating tight metric inequalities by bilevel programming
zbMATH Open document ID: 1258.90099
author: Sara Mattia
published in: Operations Research Letters
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6141244
zbMATH Keywords: network design
zbMATH Keywords: capacity formulation
zbMATH Keywords: cutting planes
describes a project that uses: SNDlib
MaRDI profile type: Publication
full work available at URL: j.orl.2012.09.009
OpenAlex ID: W1987357293
cites work: k-Partition-based facets of the network design problem
cites work: On capacitated network design cut-set polyhedra
cites work: Metric inequalities and the network loading problem
cites work: Network Design Using Cut Inequalities
cites work: Minimum cost capacity installation for multicommodity network flows
cites work: Bilevel programming: a survey
cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
cites work: An improved Benders decomposition applied to a multi-layer network design problem
cites work: Diversification strategies in local search for a nonbifurcated network loading problem
cites work: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
cites work: A branch-and-cut algorithm for capacitated network design problems
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: Q5629416
cites work: The convex hull of two core capacitated network design problems
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: Solving survivable two-layer network design problems by metric inequalities
cites work: On cut-based inequalities for capacitated network design polyhedra
DOI: 10.1016/J.ORL.2012.09.009
Recommended article: Bilevel programming and the separation problem
Recommended article: New optimality conditions for bilevel programs by using an exact separation principle
Recommended article: Q4526902
Recommended article: Bounding duality gap for separable problems with linear constraints
Recommended article: Q3517225
Recommended article: Lifting convex inequalities for bipartite bilinear programs
Recommended article: Q3837186
Recommended article: Bilevel optimization problems in topological spaces
Recommended article: Bilevel Polynomial Programs and Semidefinite Relaxation Methods
description: scientific article; zbMATH DE number 6141244