- A procedure-based heuristic for 0-1 Multiple Knapsack Problems
- Composition of graphs and the Hop-constrained Path Problem
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Polynomial time computability of some graph parameters for superclasses of perfect graphs
- A gradient-based randomised heuristic for the maximum cut problem
- Approximating the asymmetric profitable tour
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
4 May 2012
Special issue: Polyhedra and combinatorial optimisation
International Journal of Mathematics in Operational Research 4(3) 2012
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment