Pages that link to "Item:Q3439163"
From MaRDI portal
The following pages link to Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163):
Displaying 9 items.
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- A theorem connecting utility function optimization and compromise programming (Q1180825) (← links)
- On some connections among variational inequalities, combinatorial and continuous optimization (Q1904715) (← links)
- Linear vs. quadratic portfolio selection models with hard real-world constraints (Q2355713) (← links)
- A new method for mean-variance portfolio optimization with cardinality constraints (Q2393351) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- A combinatorial bound for linear programming and related problems (Q5096811) (← links)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
