Cutting plane algorithms for 0-1 programming based on cardinality cuts
View/
Date
2010Journal Title
European Journal of Operational Research
Language
English
Type
Article
Metadata
Show full item recordPlease cite this item using this persistent URL
http://hdl.handle.net/11693/22224Abstract
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.
Published as
http://dx.doi.org/10.1016/j.ejor.2010.01.006Collections
- Research Paper 7144
Related items
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
(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 ... -
The multi-terminal maximum-flow network-interdiction problem
(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 ... -
Provisioning virtual private networks under traffic uncertainty
(2007)We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic ...
