Pages that link to "Item:Q1709582"
From MaRDI portal
The following pages link to A theory and algorithms for combinatorial reoptimization (Q1709582):
Displaying 13 items.
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems (Q4609785) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- (Q5092381) (← links)
- (Q5116470) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
- The MIP workshop 2023 computational competition on reoptimization (Q6590466) (← links)
- Progressively strengthening and tuning MIP solvers for reoptimization (Q6590467) (← links)
