State-space relaxation procedures for the computation of bounds to routing problems
From MaRDI portal
Publication:3908783
Cites work
Cited in
(86)- Methods for routing with time windows
- A bi-criteria heuristic for the vehicle routing problem with time windows
- A result on projection for the vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- Scheduling examinations to reduce second-order conflicts
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A genetic algorithm for service level based vehicle scheduling
- MIP modelling of changeovers in production planning and scheduling problems
- Algorithms for large scale set covering problems
- State space relaxation for set covering problems related to bus driver scheduling
- A dynamic programming method for single machine scheduling
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A classification of formulations for the (time-dependent) traveling salesman problem
- A dynamic programming based algorithm for the crew scheduling problem.
- Constraint programming and operations research
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- A branch-and-price approach to the feeder network design problem
- Route relaxations on GPU for vehicle routing problems
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Stronger K-tree relaxations for the vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Routing problems: A bibliography
- Perspectives on integer programming for time-dependent models
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Exact solution techniques for two-dimensional cutting and packing
- An iterative dynamic programming approach for the temporal knapsack problem
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- Stochastic decision diagrams
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- An exact algorithm for single-machine scheduling without machine idle time
- Beam-ACO for the travelling salesman problem with time windows
- A heuristic for cumulative vehicle routing using column generation
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Solving the single crane scheduling problem at rail transshipment yards
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Discrete optimization by optimal control methods. I: Separable problems
- Discrete optimization by optimal control methods. II: The static traveling salesman problem
- Formulations and exact algorithms for the vehicle routing problem with time windows
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Lower bounds from state space relaxations for concave cost network flow problems
- A branch-and-bound algorithm for concave network flow problems
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Exact solution of network flow models with strong relaxations
- Discrete optimization with decision diagrams
- A time bucket formulation for the traveling salesman problem with time windows
- New state-space relaxations for solving the traveling salesman problem with time windows
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Procedures for the bin packing problem with precedence constraints
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Network-based approximate linear programming for discrete optimization
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- A branch and bound algorithm for the capacitated vehicle routing problem
- Scheduling tasks on moving executors to minimise the maximum lateness
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- The hazardous orienteering problem
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Last fifty years of integer linear programming: a focus on recent practical advances
- Contemporary approaches in matheuristics an updated survey
- Models for a traveling purchaser problem with additional side-constraints
- Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems
- Beware of the classical benchmark instances for the traveling salesman problem with time windows
- A memory-enhanced greedy randomized adaptive search procedure for the multi-pickup and delivery problem with time windows
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A column generation approach to the heterogeneous fleet vehicle routing problem
- The use of state space relaxation for the dynamic facility location problem
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- A dynamic programming based heuristic for the assembly line balancing problem
- An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
- An exact solution framework for a broad class of vehicle routing problems
This page was built for publication: State-space relaxation procedures for the computation of bounds to routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3908783)
