Enhanced mixed integer programming techniques and routing problems (Q657574): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10288-010-0140-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055407550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project for mixed 0-1 programming: recent progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Two Row Tableau Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of disjunctive cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ILP improvement procedure for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10288-010-0140-X / rank
 
Normal rank

Latest revision as of 00:04, 10 December 2024

scientific article
Language Label Description Also known as
English
Enhanced mixed integer programming techniques and routing problems
scientific article

    Statements

    Enhanced mixed integer programming techniques and routing problems (English)
    0 references
    0 references
    0 references
    10 January 2012
    0 references
    mixed integer programming
    0 references
    disjunctive cuts
    0 references
    two-row cuts
    0 references
    vehicle routing problems
    0 references
    traveling salesman problem with time windows
    0 references
    local search
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references