An ordering (enumerative) algorithm for nonlinear \(0-1\) programming

DOI10.1007/BF01096457zbMath0821.90084OpenAlexW2065569710MaRDI QIDQ1338536

Fatih Yilmaz, Béla Vizvári

Publication date: 1 December 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096457

zbMATH Keywords

set packing problems

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Boolean programming (90C09)

Related Items (2)

Maximum weight archipelago subgraph problem ⋮ Generating dual-bounded hypergraphs

Cites Work

• Covering Relaxation for Positive 0-1 Polynomial Programs
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• Testing for Vision Loss in Glaucoma Suspects
• Kombinatorisclie algorithmen zur lösung spezieller niehtlinearer 0–l-optimierungsanfgaben
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An ordering (enumerative) algorithm for nonlinear \(0-1\) programming