Pages that link to "Item:Q1353370"

The following pages link to Robust discrete optimization and its applications (Q1353370):

Displaying 50 items.

• Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
• Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems (Q2407884) (← links)
• Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
• Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
• Robust recoverable and two-stage selection problems (Q2410249) (← links)
• Robust scheduling with budgeted uncertainty (Q2414457) (← links)
• Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
• Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804) (← links)
• Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
• Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
• Improved approximation algorithms for the Min-Max selecting items problem (Q2445242) (← links)
• The balanced minimum evolution problem under uncertain data (Q2446823) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• 2-stage robust MILP with continuous recourse variables (Q2449080) (← links)
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
• Risk-averse two-stage stochastic programs in furniture plants (Q2454333) (← links)
• The design of robust value-creating supply chain networks (Q2454337) (← links)
• Adaptive memory programming for the robust capacitated international sourcing problem (Q2456637) (← links)
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
• Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617) (← links)
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
• Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization (Q2462558) (← links)
• On the concept of decision aiding process: an operational perspective (Q2468334) (← links)
• Meta-heuristics for stable scheduling on a single machine (Q2468477) (← links)
• A methodology to create robust job rotation schedules (Q2468748) (← links)
• An overview of bilevel optimization (Q2480262) (← links)
• The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (Q2488241) (← links)
• Robust optimization of contaminant sensor placement for community water systems (Q2492697) (← links)
• Strong formulations of robust mixed 0-1 programming (Q2502200) (← links)
• Persistence in discrete optimization under data uncertainty (Q2502201) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• Effective location models for sorting recyclables in public management (Q2514790) (← links)
• Bulk-robust combinatorial optimization (Q2515045) (← links)
• Passive cold devices for vaccine supply chains (Q2516746) (← links)
• The minmax regret permutation flow-shop problem with two jobs (Q2572850) (← links)
• The robust shortest path problem in series -- parallel multidigraphs with interval data (Q2583712) (← links)
• Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation (Q2629615) (← links)
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
• The robust minimum spanning tree problem: compact and convex uncertainty (Q2643812) (← links)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
• A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← links)
• Robust single machine makespan scheduling with release date uncertainty (Q2661573) (← links)
• Particle swarm metaheuristics for robust optimisation with implementation uncertainty (Q2664325) (← links)
• Optimal pricing to minimize maximum regret with limited demand information (Q2664419) (← links)
• Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
• A compact reformulation of the two-stage robust resource-constrained project scheduling problem (Q2668660) (← links)
• Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming (Q2668793) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty (Q2669731) (← links)