A class of polynomially solvable 0-1 programming problems and an application

DOI10.1007/s11425-010-4112-6zbMath1246.90106OpenAlexW2088363756MaRDI QIDQ547367

Jinxing Xie, Miao Wang, Huachun Xiong

Publication date: 1 July 2011

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-010-4112-6

zbMATH Keywords

0-1 programmingsupply chain managementpolynomial-time algorithms

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

• Lehman's forbidden minor characterization of ideal 0-1 matrices
• The value of early order commitment in a two-level supply chain
• Efficient solutions for special zero-one programming problems
• Price discount based on early order commitment in a single manufacturer-multiple retailer supply chain
• A probabilistic heuristic for a computationally difficult set covering problem
• A note on ``Price discount based on early order commitment in a single manufacturer-multiple retailer supply chain
• Perfect zero–one matrices
• Unnamed Item

This page was built for publication: A class of polynomially solvable 0-1 programming problems and an application