Pages that link to "Item:Q3908783"
From MaRDI portal
The following pages link to State-space relaxation procedures for the computation of bounds to routing problems (Q3908783):
Displaying 50 items.
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
- A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
- The use of state space relaxation for the dynamic facility location problem (Q920008) (← links)
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
- A dynamic programming based heuristic for the assembly line balancing problem (Q958561) (← links)
- An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Methods for routing with time windows (Q1068008) (← links)
- A bi-criteria heuristic for the vehicle routing problem with time windows (Q1102175) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- Scheduling examinations to reduce second-order conflicts (Q1200827) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
- A dynamic programming method for single machine scheduling (Q1331548) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- A branch-and-price approach to the feeder network design problem (Q1681514) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- Stochastic decision diagrams (Q2170193) (← links)
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities (Q2197325) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
