Row and column generation technique for a multistage cutting stock problem
Computers and Operations Research
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
SCIL - Symbolic Constraints in Integer Linear Programming
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Parallel branch and cut for capacitated vehicle routing
Parallel Computing - Special issue: Parallel computing in logistics
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms
Software—Practice & Experience
Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
A branch-and-cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Polyhedral Analysis for Concentrator Location Problems
Computational Optimization and Applications
INFORMS Journal on Computing
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
A cutting plane algorithm for graph coloring
Discrete Applied Mathematics
Computers and Industrial Engineering
Computing Maximum C-Planar Subgraphs
Graph Drawing
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Experiments on exact crossing minimization using column generation
Journal of Experimental Algorithmics (JEA)
Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
A Branch-and-Cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
From high-level model to branch-and-price solution in G12
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A branch-and-price algorithm for the risk-equity constrained routing problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Experiments on exact crossing minimization using column generation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Experiments with a generic dantzig-wolfe decomposition for integer programs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A branch-and-cut approach to the crossing number problem
Discrete Optimization
Linear optimization over permutation groups
Discrete Optimization
Minimizing breaks by maximizing cuts
Operations Research Letters
A polyhedral study of the maximum edge subgraph problem
Discrete Applied Mathematics
Hi-index | 0.00 |