Polynomial solvability of special problems of disjunctive programming

MaRDI QIDQ5932893zbMATH OpenFDO

Authors Aleksandra Borisovna Zinchenko

Publication date 17 June 2001

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

disjunctive programmingminimax problems

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)

Recommendations

• scientific article; zbMATH DE number 4091172
• Models of the nonguillotine sheet and strip rectangular packing problem
• scientific article; zbMATH DE number 3904609
• The rectangular packing problem: local optimum search methods based on block structures
• A near-optimal solution to a two-dimensional cutting stock problem

Cited in

(1)

• scientific article; zbMATH DE number 3843508 (Why is no real title available?)

This page was built for publication: Polynomial solvability of special problems of disjunctive programming

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