Lagrangian relaxations and cutting planes in solving set partitioning problems
Exact and heuristic algorithms for solving difficult problems related to computati...
Integer programming algorithms for identifying network matrices in linear systems
Dual bounds and exact algorithms for minimum dilation problems in geometric graphs
Heuristics for entire programming with feasible and infeasible search paths
The study of theoretical and practical combinatorial optimization problems applied...