The fundamental theorem of linear programming: extensions and applications
From MaRDI portal
Publication:2996803
DOI10.1080/02331934.2010.506535zbMath1219.90120OpenAlexW2020200693MaRDI QIDQ2996803
Publication date: 3 May 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.506535
quadratic programmingapproximation algorithmsmaximum cliqueconcave programmingpseudo-Boolean optimizationfundamental theorem of linear programming
Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items
A new method for mean-variance portfolio optimization with cardinality constraints, Risk‐averse optimization and resilient network flows, Linear vs. quadratic portfolio selection models with hard real-world constraints
Cites Work
- Branch-and-bound approaches to standard quadratic optimization problems
- Pseudo-Boolean optimization
- A clique algorithm for standard quadratic programming
- On a class of functions attaining their maximum at the vertices of a polyhedron
- The ellipsoid method and its consequences in combinatorial optimization
- On standard quadratic optimization problems
- On extensions of the Frank-Wolfe theorems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- An extension of the fundamental theorem of linear programming
- Reverse search for enumeration
- Perspectives of Monge properties in optimization
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- On the equivalence between some discrete and continuous optimization problems
- A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Adjacency on polymatroids
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- A generalization of the Frank—Wolfe theorem
- Minimizing a Submodular Function on a Lattice
- Continuous Characterizations of the Maximum Clique Problem
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- Affine parameter-dependent Lyapunov functions and real parametric uncertainty
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
- On Quadratic Programming
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
