Metric inequalities and the network loading problem (Q2471279): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q173869
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pasquale Avella / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968016922 / 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: On splittable and unsplittable flow capacitated network design arc-set polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential function methods for approximately solving linear programming problems: theory and practice. / 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: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of maximally violated mod-\(k\) cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source sink flows with capacity installation in batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the membership problem for the elementary closure of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities / 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: Totally tight Chvatal-Gomory cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234145 / 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: A polyhedral approach to multicommodity survivable network design / rank
 
Normal rank

Revision as of 16:40, 27 June 2024

scientific article
Language Label Description Also known as
English
Metric inequalities and the network loading problem
scientific article

    Statements

    Metric inequalities and the network loading problem (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2008
    0 references
    network loading
    0 references
    metric inequalities
    0 references
    cutting planes
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers