Pages that link to "Item:Q2419508"
From MaRDI portal
The following pages link to A feasible rounding approach for mixed-integer optimization problems (Q2419508):
Displaying 7 items.
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- Feasible rounding approaches for equality constrained mixed-integer optimization problems (Q5880390) (← links)
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization (Q6114963) (← links)
- One-shot learning for MIPs with SOS1 constraints (Q6579097) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
