A disjunctive cutting plane algorithm for the extreme point mathematical programming problem

From MaRDI portal

Revision as of 23:29, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1058456

Jump to:navigation, search

zbMath0564.90046MaRDI QIDQ1058456

Hanif D. Sherali

Publication date: 1985

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

computational experience cutting plane algorithm extreme point mathematical programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (3)

A finite procedure to generate feasible points for the extreme point mathematical programming problem ⋮ A finite algorithm for solving the generalized lattice point problem ⋮ An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

This page was built for publication: A disjunctive cutting plane algorithm for the extreme point mathematical programming problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1058456&oldid=13072027"