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

DOI10.1007/S11425-010-4112-6zbMATH Open1246.90106OpenAlexW2088363756MaRDI QIDQ547367FDOQ547367

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

supply chain managementpolynomial-time algorithms0-1 programming

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

• Title not available (Why is that?)
• A probabilistic heuristic for a computationally difficult set covering problem
• Perfect zero–one matrices
• Price discount based on early order commitment in a single manufacturer-multiple retailer supply chain
• A note on ``Price discount based on early order commitment in a single manufacturer-multiple retailer supply chain
• 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

Cited In (5)

• Title not available (Why is that?)
• A solvable class of quadratic 0-1 programming
• Title not available (Why is that?)
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
• Persistency in 0-1 polynomial programming

   Recommendations

• Title not available (Why is that?) 👍 👎
• A polynomially solvable class of two-level nonlinear programming problems 👍 👎
• A linearization method for mixed 0--1 polynomial programs 👍 👎
• On the polynomial mixed 0-1 fractional programming problems 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547367)