COIN-OR::LEMON - Graph Library

Version 4 (modified by Alpar Juttner, 2 years ago) (diff)

--

Alk. Modul előadások

November 8.

Naveen Garg, Jochen Konemann. ''Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems''

This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min-cost multicommodity flow; this yields much faster algorithms when the number of commodities is large.

November 15.

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W.P. Savelsbergh, P. H. Vance. ''Branch-and-Price: Column Generation for Solving Huge Integer Programs''

We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e. implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree. We present classes of models for which this approach decomposes the problem, provides tighter LP relaxations and eliminates symmetry. We then discuss computational issues and implementation of column generation, branch-and-bound algorithms, including special branching rules and effient ways to solve the LP relaxation.

November 22.

Alexandre Belloni. ''Lecture Notes for IAP 2005 Course Introduction to Bundle Methods''

November 29.

D. P. Ronconi and M. S. Kawamura. ''The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm''

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

December 6.

December 13.

Attachments (6)