Pages that link to "Item:Q1353370"

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

Displaying 50 items.

• Robust discrete optimization and network flows (Q1424278) (← links)
• A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
• On the complexity of the robust spanning tree problem with interval data (Q1433657) (← links)
• Algorithms for the robust 1-center problem on a tree (Q1569932) (← links)
• Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
• An exact algorithm for the fuzzy p-median problem (Q1610128) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (Q1634054) (← links)
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
• A VNS-LP algorithm for the robust dynamic maximal covering location problem (Q1642060) (← links)
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
• Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria (Q1650398) (← links)
• A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← links)
• MIP-based approaches for robust storage loading problems with stacking constraints (Q1652064) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
• Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• Characterizations for optimality conditions of general robust optimization problems (Q1670134) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) (← links)
• On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
• The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
• Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
• A survey on risk-averse and robust revenue management (Q1694904) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights (Q1706134) (← links)
• Min-ordering and max-ordering scalarization methods for multi-objective robust optimization (Q1713738) (← links)
• Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
• Multi-objective optimization using statistical models (Q1728516) (← links)
• Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
• A unified characterization of multiobjective robustness via separation (Q1730800) (← links)
• Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation (Q1731818) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
• Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market (Q1744521) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A unified approach to uncertain optimization (Q1753451) (← links)
• A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
• Robust multiobjective portfolio optimization: A minimax regret approach (Q1754045) (← links)
• Scenario-based portfolio model for building robust and proactive strategies (Q1754078) (← links)
• Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty (Q1760657) (← links)
• An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
• Robust optimization analysis for multiple attribute decision making problems with imprecise information (Q1761928) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
• Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
• Project scheduling under uncertainty: survey and research potentials (Q1772834) (← links)