Pages that link to "Item:Q5935709"

The following pages link to On the complexity of a class of combinatorial optimization problems with uncertainty (Q5935709):

Displaying 50 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty (Q334254) (← links)
• On discrete optimization with ordering (Q367635) (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
• The robust set covering problem with interval data (Q367647) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
• Constrained shortest path with uncertain transit times (Q496598) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• Almost robust discrete optimization (Q666949) (← links)
• Robust resource allocations in temporal networks (Q715076) (← links)
• Robust approach to restricted items selection problem (Q828685) (← links)
• On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
• Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
• Min-max regret robust optimization approach on interval data uncertainty (Q946180) (← links)
• Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
• On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
• Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
• Combinatorial optimization under uncertainty (Q1008321) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
• Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
• An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• Minmax regret linear resource allocation problems. (Q1417598) (← links)
• A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• Robust location of new housing developments using a choice model (Q1730557) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• Robust optimization analysis for multiple attribute decision making problems with imprecise information (Q1761928) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Distributionally robust discrete optimization with entropic Value-at-Risk (Q1785302) (← links)
• Interval data minmax regret network optimization problems (Q1827805) (← links)
• On the complexity of minmax regret linear programming (Q1887882) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)