Pages that link to "Item:Q1353370"

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

Displaying 50 items.

• On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
• About the applicability of MCDA to some robustness problems (Q858365) (← links)
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
• Robust capacity assignment in telecommunications (Q867429) (← links)
• Preference programming for robust portfolio modeling and project selection (Q877643) (← links)
• Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
• Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← 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)
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
• Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
• Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
• Robust portfolio modeling with incomplete cost information and project interdependencies (Q928031) (← links)
• A note on the minmax regret centdian location on trees (Q935247) (← links)
• Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
• Simulated annealing algorithm for the robust spanning tree problem (Q945053) (← links)
• Min-max regret robust optimization approach on interval data uncertainty (Q946180) (← links)
• \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
• A two-stage stochastic programming model for transportation network protection (Q960408) (← links)
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← 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)
• A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
• A new model for path planning with interval data (Q1000974) (← links)
• Some tractable instances of interval data minmax regret problems (Q1003488) (← 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)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
• Robust improvement schemes for road networks under demand uncertainty (Q1026775) (← links)
• A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
• Two-stage flexible-choice problems under uncertainty (Q1037661) (← links)
• Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net (Q1037666) (← links)
• Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
• Maximizing the net present value of a project under uncertainty (Q1039778) (← links)
• Robust placement of sensors in dynamic water distribution systems (Q1040992) (← links)
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← 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)
• The design of robust value-creating supply chain networks: a critical review (Q1046092) (← links)
• Models for robust tactical planning in multi-stage production systems with uncertain demands (Q1046703) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• Geometric methods to solve max-ordering location problems (Q1289016) (← links)
• Minmax regret linear resource allocation problems. (Q1417598) (← links)