CP27 Integer Programming II

1:30 PM-3:30 PM
Room: Atlanta 5
Chair: Steffen G. Meusel, University of Leipzig, Germany

1:30-1:45 Solving General Integer Allocation Problems by Global Optimization Approach: Yang Dai, Tokyo Institute of Technology, Japan
1:50-2:05 A Minimum Weighted Integer Coloring Algorithm Based on Iteratively Improving Lower Bounds: Jue Xue and Ju Liu, City University of Hong Kong, China
2:10-2:25 The Monge-Property for a Placement Problem: Steffen G. Meusel, University of Leipzig, Germany
2:30-2:45 Normalizations in Lift and Project Methods. A View From Convex Analysis: Pablo Rey, DEE/PUC-Rio de Janeiro, Brazil; and Claudia Sagastizábal , DEE/PUC-Rio de Janeiro, Brazil and INRIA, Le Chesnay, France
2:50-3:05 A Branch and Bound Method for Finding a Feasible Point of a System of Nonconvex Quadratic Inequalities Under Box Constraints: O. V. Khamisov, Energy Systems Institute, Irkutsk, Russia
3:10-3:25 Large-Scale Integer Programs in Image Analysis

G. Dahl, G. Storvik and A. Fadnes, University of Oslo, Norway
3:30-3:45 Nonlinear Lagrangian Methods in Constrained Integer Programming

Duan Li, Chinese University of Hong Kong, China; and Xiaoling Sun, Shanghai University, China

LMH, 12/10/98, MMD, 3/1/99