Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
From MaRDI portal
Publication:3439163
DOI10.1016/j.endm.2004.03.054zbMath1125.90403OpenAlexW2090409762MaRDI QIDQ3439163
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.054
Related Items
A new method for mean-variance portfolio optimization with cardinality constraints, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, The fundamental theorem of linear programming: extensions and applications, A clique algorithm for standard quadratic programming, Linear vs. quadratic portfolio selection models with hard real-world constraints
Cites Work