Efficient Solutions for Special Zero-One Programming Problems

Ariela Bilitzky () and Arik Sadeh ()
Additional contact information
Ariela Bilitzky: College of Management
Arik Sadeh: Holon Academic Institute of Technology

Journal of Combinatorial Optimization, 2005, vol. 10, issue 3, No 2, 227-238

Abstract: Abstract A zero-one linear programming is under consideration. It has been proved that for special structures and values of the parameters, the solution of the linear relaxation of the problem is integral and can be either predetermined or computed efficiently. In general, a tight upper bound is provided in order to establish an efficient procedure for solving the problem. The results may have practical implementations in knowledge—management, data-mining, network flow, graph theory, reliability and statistical studies.

Keywords: zero-one programming; linear relaxation; combinatorial optimization (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-4104-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:10:y:2005:i:3:d:10.1007_s10878-005-4104-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-4104-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().