Separating tight metric inequalities by bilevel programming (Q1939716): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: k-Partition-based facets of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On capacitated network design cut-set polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition applied to a multi-layer network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification strategies in local search for a nonbifurcated network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex hull of two core capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving survivable two-layer network design problems by metric inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cut-based inequalities for capacitated network design polyhedra / rank
 
Normal rank

Latest revision as of 06:32, 6 July 2024

scientific article
Language Label Description Also known as
English
Separating tight metric inequalities by bilevel programming
scientific article

    Statements

    Separating tight metric inequalities by bilevel programming (English)
    0 references
    0 references
    5 March 2013
    0 references
    0 references
    network design
    0 references
    capacity formulation
    0 references
    cutting planes
    0 references
    0 references