A class of polynomially solvable 0-1 programming problems and an application
From MaRDI portal
Publication:547367
Recommendations
- scientific article; zbMATH DE number 1094193
- 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
- The necessary conditions and the algorithm for a special class of 0-1 quadratic programming problem
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A note on ``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
- Efficient solutions for special zero-one programming problems
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Perfect zero–one matrices
- Price discount based on early order commitment in a single manufacturer-multiple retailer supply chain
- The value of early order commitment in a two-level supply chain
Cited in
(5)- Persistency in 0-1 polynomial programming
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- scientific article; zbMATH DE number 1505873 (Why is no real title available?)
- scientific article; zbMATH DE number 3843508 (Why is no real title available?)
- A solvable class of quadratic 0-1 programming
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)
