Guided design search in the interval-bounded sailor assignment problem
From MaRDI portal
Publication:2581609
DOI10.1016/J.COR.2004.11.012zbMATH Open1087.90518OpenAlexW2073732740MaRDI QIDQ2581609FDOQ2581609
Authors: Mark W. Lewis, Karen R. Lewis, Barbara J. White
Publication date: 10 January 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.11.012
Recommendations
- Navy Personnel Planning and the Optimal Partition
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- A branch-and-price guided search approach to maritime inventory routing
Cites Work
Cited In (2)
Uses Software
This page was built for publication: Guided design search in the interval-bounded sailor assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581609)