Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
Publication:2273651
DOI10.1016/j.cor.2019.05.031zbMath1458.90124OpenAlexW2947519521WikidataQ127761229 ScholiaQ127761229MaRDI QIDQ2273651
David A. Bader, Shabbir Ahmed, Lluís-Miquel Munguía, Yufen Shao, Dimitri J. Papageorgiou, Nemhauser, George I.
Publication date: 25 September 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.031
parallel computingdiscrete optimizationlarge neighborhood searchprimal heuristicsmaritime inventory routing
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Multimodal freight transportation planning: a literature review
- A comprehensive annual delivery program for upstream liquefied natural gas supply chain
- A maritime inventory routing problem with stochastic sailing and port times
- A maritime inventory routing problem: practical approach
- Using and extending fix-and-relax to solve maritime inventory routing problems
- A branch-and-price guided search approach to maritime inventory routing
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Could we use a million cores to solve an integer program?
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- Measuring the impact of primal heuristics
- Hybrid heuristics for a short sea inventory routing problem
- Constraint programming for LNG ship scheduling and inventory management
- A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
- Production Planning by Mixed Integer Programming
This page was built for publication: Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing