  


Semicontinuous network flow problems
Gustavo Angulo(gangulogatech.edu) Abstract: We consider semicontinuous network flow problems, that is, a class of network flow problems where some of the variables are restricted to be semicontinuous. We introduce the semicontinuous inflow set with variable upper bounds as a relaxation of general semicontinuous network flow problems. Two particular cases of this set are considered, for which we present complete descriptions of the convex hull in terms of linear inequalities and extended formulations. We consider a class of semicontinuous transportation problems where inflow systems arise as substructures, for which we investigate complexity questions. Finally, we study the computational efficacy of the developed polyhedral results in solving randomly generated instances of semicontinuous transportation problems. Keywords: Mixedinteger programming, network flow problems, semicontinuous variables Category 1: Integer Programming ((Mixed) Integer Linear Programming ) Category 2: Network Optimization Citation: Download: [PDF] Entry Submitted: 04/26/2012 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  