Perspectives on integer programming for time-dependent models
type: Item
instance of: scholarly article
title: Perspectives on integer programming for time-dependent models
zbMATH Open document ID: 1418.90160
author: Natashia Boland
author: Martin W. P. Savelsbergh
published in: Top
publication date: 2019-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7079030
zbMATH Keywords: integer programming
zbMATH Keywords: time-expanded network
zbMATH Keywords: dynamic discretization discovery
zbMATH Keywords: traveling salesman problem with time windows
describes a project that uses: TSPTW
describes a project that uses: bc-prod
MaRDI profile type: Publication
full work available at URL: s11750-019-00514-4
OpenAlex ID: W2943890712
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
cites work: A Class of Continuous Network Flow Problems
cites work: Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
cites work: New state-space relaxations for solving the traveling salesman problem with time windows
cites work: On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
cites work: Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
cites work: A bucket indexed formulation for nonpreemptive single machine scheduling problems
cites work: The Continuous-Time Service Network Design Problem
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
cites work: A time bucket formulation for the traveling salesman problem with time windows
cites work: A hybrid exact algorithm for the TSPTW
cites work: On the complexity of time-dependent shortest paths
cites work: Load-dependent and precedence-based models for pickup and delivery problems
cites work: Layered graph approaches for combinatorial optimization problems
cites work: Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
cites work: Resource extension functions: properties, inversion, and generalization to segments
cites work: Shortest Path Problems with Resource Constraints
cites work: Path-reduced costs for eliminating arcs in routing and scheduling
cites work: A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
cites work: An integer programming approach for the time-dependent traveling salesman problem with time windows
cites work: An exact constraint logic programming algorithm for the traveling salesman problem with time windows
cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
cites work: Continuous-Time Flows in Networks
cites work: An adaptive discretization algorithm for a class of continuous network programs
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A survey of resource constrained shortest path problems: exact solution approaches
cites work: An Introduction to Network Flows over Time
DOI: 10.1007/S11750-019-00514-4
Recommended article: Comments on: ``Perspectives on integer programming for time-dependent models''
Recommended article: Rejoinder on: ``Perspectives on integer programming for time-dependent models''
Recommended article: Stochastic integer programming: general models and algorithms
Recommended article: An integer programming approach for the time-dependent TSP
Recommended article: Q5850736
Recommended article: Integer programming models for the \(q\)-mode problem
Recommended article: Integer programming as a framework for optimization and approximability
Recommended article: Q3686502
description: scientific article; zbMATH DE number 7079030