Pages that link to "Item:Q1353370"
From MaRDI portal
The following pages link to Robust discrete optimization and its applications (Q1353370):
Displaying 50 items.
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- A framework for co-optimization algorithm performance and its application to worst-case optimization (Q487990) (← links)
- Robust UAV mission planning (Q490224) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- Constrained shortest path with uncertain transit times (Q496598) (← links)
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- Robust unit commitment with \(n-1\) security criteria (Q530420) (← links)
- An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
- Scheduling with uncertainties on new computing platforms (Q535305) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← links)
- Conditional median as a robust solution concept for uncapacitated location problems (Q611014) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- Flexible-attribute problems (Q616800) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
- Deterministic risk control for cost-effective network connections (Q621844) (← links)
- On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- A classical decision theoretic perspective on worst-case analysis (Q664404) (← links)
- Almost robust discrete optimization (Q666949) (← links)
- Robust balanced optimization (Q668952) (← links)
- Portfolio optimization with \(pw\)-robustness (Q668953) (← links)
- Reliable intermodal freight network expansion with demand uncertainties and network disruptions (Q681449) (← links)
- A robust lot sizing problem with ill-known demands (Q690887) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization (Q707779) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- Reduction approaches for robust shortest path problems (Q716356) (← links)
- Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
- One approach to solving a discrete production planning problem with interval data (Q735645) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty (Q763115) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Robust portfolio optimization: a categorized bibliographic review (Q827129) (← links)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
- Scheduling for stability in single-machine production systems (Q835553) (← links)
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- A generic stochastic model for supply-and-return network design (Q850288) (← links)
- Stochastic constraint programming: A scenario-based approach (Q850457) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
