CP methods for scheduling and routing with~time-dependent task costs
From MaRDI portal
Publication:2513747
DOI10.1007/s13675-014-0022-7zbMath1305.90064DBLPjournals/ejco/KelarevaTK14OpenAlexW2057337985WikidataQ60145763 ScholiaQ60145763MaRDI QIDQ2513747
Philip Kilby, Elena Kelareva, Kevin Tierney
Publication date: 28 January 2015
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-014-0022-7
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing liner shipping fleet repositioning plans
- A maritime inventory routing problem: practical approach
- SCIP: solving constraint integer programs
- The design of the zinc modelling language
- The traveling salesman problem with draft limits
- A mathematical model of inter-terminal transportation
- Propagation via lazy clause generation
- Symmetries, almost symmetries, and lazy clause generation
- Ship routing and scheduling in the new millennium
- STRIPS: A new approach to the application of theorem proving to problem solving
- COLIN: Planning with Continuous Linear Numeric Change
- On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Robust ship scheduling with multiple time windows
- CP Methods for Scheduling and Routing with Time-Dependent Task Costs
- Reducing fuel emissions by optimizing speed on shipping routes
- Cash Flows in Networks
- The payment scheduling problem
- Ship scheduling with soft time windows: An optimisation based approach
This page was built for publication: CP methods for scheduling and routing with~time-dependent task costs
