Pages that link to "Item:Q1393350"
From MaRDI portal
The following pages link to Convexity cuts for multiple choice problems (Q1393350):
Displayed 6 items.
- A heuristic for multiple choice programming (Q1089261) (← links)
- Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
- Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming (Q1821036) (← links)
- A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)