Pages that link to "Item:Q1025986"
From MaRDI portal
The following pages link to Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986):
Displayed 5 items.
- Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
