A branch and cut algorithm for hub location problems with single assignment (Q1771311): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-004-0531-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070737799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Facility Location: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location: Separation algorithms and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for access network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for the capacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and facets of the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentrator location in telecommunications networks. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-004-0531-X / rank
 
Normal rank

Latest revision as of 10:13, 11 December 2024

scientific article
Language Label Description Also known as
English
A branch and cut algorithm for hub location problems with single assignment
scientific article

    Statements

    A branch and cut algorithm for hub location problems with single assignment (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2005
    0 references
    Hub location
    0 references
    Polyhedral analysis
    0 references
    Branch and cut
    0 references
    0 references
    0 references

    Identifiers