Hybrid optimization methods for time-dependent sequencing problems (Q1751901): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The time dependent traveling salesman problem: polyhedra and algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to single-machine scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved filtering for weighted circuit constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with learning considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivalued Decision Diagrams for Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: In Pursuit of the Traveling Salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural and extended formulations for the time-dependent 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: A classification of formulations for the (time-dependent) traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delivery man problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling problems with a position-dependent deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in single-machine scheduling with step-deterioration of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative Family of Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrepancy-Based Additive Bounding Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time‐dependent traveling salesman problem–the deliveryman case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets and valid inequalities for the time-dependent travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for the time-dependent TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Constraints: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with position dependent job processing times: computational complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some scheduling problems with general position-dependent and time-dependent learning effects / rank
 
Normal rank

Revision as of 16:51, 15 July 2024

scientific article
Language Label Description Also known as
English
Hybrid optimization methods for time-dependent sequencing problems
scientific article

    Statements

    Hybrid optimization methods for time-dependent sequencing problems (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    constraint programming
    0 references
    sequencing
    0 references
    decision diagrams
    0 references
    additive bounding
    0 references
    0 references
    0 references
    0 references

    Identifiers