An interior point cutting plane heuristic for mixed integer programming
Year of publication: |
2011
|
---|---|
Authors: | Naoum-Sawaya, Joe ; Elhedhli, Samir |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 38.2011, 9, p. 1335-1341
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics |
-
Lagrangian relaxation based heuristic for an integrated production and maintenance planning problem
Alaoui-Selsouli, M., (2012)
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
- More ...
-
A stochastic optimization model for real-time ambulance redeployment
Naoum-Sawaya, Joe, (2013)
-
A branch-and-price algorithm for the bin packing problem with conflicts
Elhedhli, Samir, (2011)
-
An interior-point Benders based branch-and-cut algorithm for mixed integer programs
Naoum-Sawaya, Joe, (2013)
- More ...