Perspectives on integer programming for time-dependent models (Q2001858): 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: 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: A Class of Continuous Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / 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: On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Continuous-Time Service Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints / 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: A Hybrid Exact Algorithm for the TSPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of time-dependent shortest paths / 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: Layered graph approaches for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource extension functions: properties, inversion, and generalization to segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for the time-dependent traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-Time Flows in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive discretization algorithm for a class of continuous network programs / 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: A survey of resource constrained shortest path problems: Exact solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Network Flows over Time / rank
 
Normal rank

Latest revision as of 21:20, 19 July 2024

scientific article
Language Label Description Also known as
English
Perspectives on integer programming for time-dependent models
scientific article

    Statements

    Perspectives on integer programming for time-dependent models (English)
    0 references
    0 references
    11 July 2019
    0 references
    integer programming
    0 references
    time-expanded network
    0 references
    dynamic discretization discovery
    0 references
    traveling salesman problem with time windows
    0 references
    0 references
    0 references

    Identifiers