Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57702120, #quickstatements; #temporary_batch_1708039819900
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116871384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric 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: Quasi-semi-metrics, oriented multi-cuts and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on projection for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended formulations for the precedence constrained asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load-dependent and precedence-based models for pickup and delivery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP / rank
 
Normal rank

Latest revision as of 16:08, 12 July 2024

scientific article
Language Label Description Also known as
English
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
scientific article

    Statements

    Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (English)
    0 references
    7 October 2016
    0 references
    sequential ordering
    0 references
    travelling salesman problem with precedence constraints
    0 references
    multi-commodity flows
    0 references
    metrics
    0 references
    polyhedral combinatorics
    0 references

    Identifiers