Cutting plane algorithms for 0-1 programming based on cardinality cuts
European Journal of Operational Research
273 - 279
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/22224
We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming as a new generation of cuts that excludes not only portions of polyhedra containing noninteger points, also parts with some integer points that have been explored in search of an optimal solution. Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems. © 2010 Elsevier B.V. All rights reserved.
Showing items related by title, author, creator and subject.
Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming Pinar, M.Ç. (2014)The lower hedging problem with a minimal expected surplus risk criterion in incomplete markets is studied for American claims in finite state financial markets. It is shown that the lower hedging problem with linear expected ...
Akgün I.; Tansel, B.Ç.; Wood, R.K. (2011)This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K ≥ 3 pre-specified node groups while an interdictor ...
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints Akgün I.; Tansel, B. (2010)Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degree constrained minimum spanning tree problem is the problem of finding a spanning tree with minimum total cost such that ...