scientific article; zbMATH DE number 2086966
From MaRDI portal
Publication:4737577
zbMATH Open1077.90553MaRDI QIDQ4737577FDOQ4737577
Authors: Aristide Mingozzi
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2371/23710051.htm
Title of this publication is not available (Why is that?)
Recommendations
- New state-space relaxations for solving the traveling salesman problem with time windows
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- Lower bounds from state space relaxations for concave cost network flow problems
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
Cited In (7)
- Constraint programming and operations research
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Lazy slicing for state-space exploration
- The use of state space relaxation for the dynamic facility location problem
- Stochastic decision diagrams
- Discrete optimization with decision diagrams
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737577)