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 | Heuristik | Heuristics | Nachbarschaft | Neighbourhood | Ganzzahlige Optimierung | Integer programming |
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
-
Metaheuristic algorithm for ship routing and scheduling problems with time window
Alhamad, Khaled, (2019)
-
An effective hybrid search method for the quadratic knapsack problem with conflict graphs
Zhou, Qing, (2024)
- 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)
-
A population-based algorithm for the railroad blocking problem
Yaghini, Masoud, (2012)
- More ...