An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
From MaRDI portal
(Redirected from Publication:580171)
Recommendations
- On Extreme Point Programming Problem
- A branch and bound algorithm for extreme point mathematical programming problems
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
- scientific article; zbMATH DE number 4199967
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3652081 (Why is no real title available?)
- scientific article; zbMATH DE number 3298499 (Why is no real title available?)
- scientific article; zbMATH DE number 3375237 (Why is no real title available?)
- scientific article; zbMATH DE number 3375242 (Why is no real title available?)
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A branch and bound algorithm for extreme point mathematical programming problems
- A classroom/time assignment model
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- Concave Programming Applied to a Special Class of 0-1 Integer Programs
- Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom
- Extreme Point Mathematical Programming
- Finding all vertices of a convex polyhedron
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Optimization with disjunctive constraints
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming
- The Generalized Lattice-Point Problem
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
Cited in
(13)- scientific article; zbMATH DE number 4199967 (Why is no real title available?)
- A primal like algorithm for extreme point fuzzy mathematical programming problem
- On Extreme Point Programming Problem
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- scientific article; zbMATH DE number 482137 (Why is no real title available?)
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
- A branch and bound algorithm for extreme point mathematical programming problems
- Degeneracy graphs: Theory and applications. An updated survey
- scientific article; zbMATH DE number 4152172 (Why is no real title available?)
- A finite algorithm for solving the generalized lattice point problem
- A versatile scheme for ranking the extreme points of an assignment polytope
- Selected bibliography on degeneracy
- Extreme point quadratic fractional programming problem
This page was built for publication: An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580171)