Projections of the capacitated network loading problem (Q1577107): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856789 / 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: Shortest paths, single origin‐destination network design, and associated polyhedra / 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: Q4040780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-terminus flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path set polytope of an acyclic, directed graph with an application to machine sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated Lot-Sizing Problems with Start-Up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programming: A survey / rank
 
Normal rank

Latest revision as of 13:32, 30 May 2024

scientific article
Language Label Description Also known as
English
Projections of the capacitated network loading problem
scientific article

    Statements

    Projections of the capacitated network loading problem (English)
    0 references
    30 August 2000
    0 references
    0 references
    integer programming
    0 references
    capacitated network design problem
    0 references
    multicommodity flow
    0 references
    facets
    0 references
    extreme rays
    0 references