A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
Year of publication: |
2015
|
---|---|
Authors: | Yaghini, Masoud ; Karimi, Mohammad ; Rahbar, Mohadeseh ; Sharifitabar, Mohammad Hassan |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 1, p. 48-58
|
Subject: | fixed-charge capacitated multicommodity network design | cutting-plane neighborhood | tabu search | design of experiments | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Heuristik | Heuristics | USA | United States |
-
Genetic based discrete particle swarm optimization for elderly day care center timetabling
Lin, Mei Yan, (2016)
-
Konstroffer, Markus, (2001)
-
An advanced tabu search approach to the dynamic airlift loading problem
Roesener, August G., (2016)
- More ...
-
A population-based algorithm for the railroad blocking problem
Yaghini, Masoud, (2012)
-
Capacity consumption analysis using heuristic solution method for under construction railway routes
Yaghini, Masoud, (2014)
-
An optimization model to solve skidding problem in steep slope terrain
Ezzati, Sattar, (2015)
- More ...