Three approximation algorithms for solving the generalized segregated storage problem.
From MaRDI portal
Publication:1426687
DOI10.1016/S0377-2217(02)00917-7zbMath1044.90054MaRDI QIDQ1426687
Publication date: 15 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
A revised formulation, library and heuristic for a chemical tanker scheduling problem ⋮ Tank allocation problems in maritime bulk shipping
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for finding a maximum clique in a graph
- Heuristic methods and applications: A categorized survey
- An Improved, Multiplier Adjustment Procedure for the Segregated Storage Problem
- AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- Network Reoptimization Algorithms: A Statistically Designed Comparison
- Solving the Segregated Storage Problem with Benders' Partitioning
This page was built for publication: Three approximation algorithms for solving the generalized segregated storage problem.