Pages that link to "Item:Q1353370"

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

Displaying 50 items.

• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Robust storage assignment in stack- and queue-based storage systems (Q1782174) (← links)
• Distributionally robust discrete optimization with entropic Value-at-Risk (Q1785302) (← links)
• Robust integer programming (Q1785307) (← links)
• Approximability of the robust representatives selection problem (Q1785311) (← links)
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) (← links)
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) (← links)
• A novel robust fuzzy stochastic programming for closed loop supply chain network design under hybrid uncertainty (Q1795042) (← links)
• On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
• Strategic facility location: A review (Q1806854) (← links)
• Robust and neutral methods for aggregating preferences into an outranking relation (Q1806918) (← links)
• Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071) (← links)
• Interval data minmax regret network optimization problems (Q1827805) (← links)
• Consistency stability intervals for a judgement in AHP decision support systems (Q1869477) (← links)
• Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
• The construction of stable project baseline schedules (Q1877894) (← links)
• An exact algorithm for the robust shortest path problem with interval data (Q1885969) (← links)
• Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
• Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• Linear programming with uncertain data: some extensions to robust optimization (Q1935291) (← links)
• On the probabilistic min spanning tree problem (Q1935723) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885) (← links)
• Robust winner determination in positional scoring rules with uncertain weights (Q1986068) (← links)
• A two-stage robust model for a reliable \(p\)-center facility location problem (Q1988633) (← links)
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
• Matching supply and demand in a sharing economy: classification, computational complexity, and application (Q1999391) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
• Relative utility bounds for empirically optimal portfolios (Q2040434) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
• The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
• Robust inventory problem with budgeted cumulative demand uncertainty (Q2091209) (← links)
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
• Minimax programming as a tool for studying robust multi-objective optimization problems (Q2108806) (← links)
• Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
• Relatively robust decisions (Q2112301) (← links)
• Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
• The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
• Multicriteria saliency detection: a (exact) robust network design approach (Q2178371) (← links)
• Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
• Constant work-space algorithms for facility location problems (Q2192101) (← links)