Pages that link to "Item:Q4162970"
From MaRDI portal
The following pages link to Technical Note—Solving Integer Programming Problems by Aggregating Constraints (Q4162970):
Displaying 13 items.
- How effective is aggregation for solving 0-1 models? (Q505111) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- On the reduction method for integer linear programs. II (Q1085786) (← links)
- Aggregation of constraints in integer programming (Q1108194) (← links)
- A result in surrogate duality for certain integer programming problems (Q1122485) (← links)
- On aggregating two linear diophantine equations (Q1383381) (← links)
- A discrete variant of Farkas' lemma (Q1728176) (← links)
- Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming (Q1821036) (← links)
- Optimal constraints aggregation method for ILP (Q2416430) (← links)
- A solution method for a knapsack problem and its variant (Q3028724) (← links)
- New results on equivalent integer programming formulations (Q4058477) (← links)
- A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme (Q4729613) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
