The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ervin Y. Rodin / rank
Normal rank
 
Property / author
 
Property / author: Ervin Y. Rodin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINTO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Crown Inequalities for the Symmetric Traveling Salesman Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of facial results for the traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-interchange procedures for local search in a precedence-constrained routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphical relaxation: A new framework for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(97)00090-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980244058 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
The pickup and delivery problem: Faces and branch-and-cut algorithm
scientific article

    Statements

    The pickup and delivery problem: Faces and branch-and-cut algorithm (English)
    0 references
    0 references
    0 references
    7 September 1998
    0 references
    pickup and delivery problem
    0 references
    dial-aride problem
    0 references
    polyhedral structure
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references

    Identifiers

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