COIN Tutorial at coral

COmputational IN frastructure for Operations Research

Branch Cut and Price (BCP) Framework

Introduction
The purpose of this webpage is to serve as a central point for ideas and contacts for COIN-or BCP users and developers.

Contacts

Name	Contact	Affiliation	OS	Applications	Type*	Arch
Matthew Galati	web email	Lehigh University	Redhat Linux	Axial Assignment Problem (algo vars)	BP, BC, BCP	serial
				Knapsack Contrained Circuit Problem (index vars)	BC, BCP	serial
				Steiner Problem in Graphs	BC	serial
				Uncapacitated Facility Location	BC	serial
				Vehicle Routing Problem (algo vars)	BC, BCP	serial
				Vehicle Routing Problem w/ TWs (algo vars)	BCP	serial
Also working on a generic framework for incorporating dynamic cut generation into traditional decomposition methods (Dantzig-Wolfe, Lagrangian Relaxation, Cutting Planes) for integer programming. This framework will interface with BCP (and eventually ALPs). Working paper.

*BP (Branch and Price), BC (Branch and Cut), BCP (Branch Cut and Price)

Current Topics/Issues