Uncertainty feature optimization: An implicit paradigm for problems with noisy data

DOI10.1002/net.20428zbMath1228.90066OpenAlexW2157498487MaRDI QIDQ3008922

Matteo Salani, Michel Bierlaire, Niklaus Eggenberg

Publication date: 22 June 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20428

zbMATH Keywords

robustnessrecoverabilityoptimization under uncertainty

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Stochastic programming (90C15) Design techniques (robust design, computer-aided design, etc.) (93B51)

Related Items (2)

Robust optimization: lessons learned from aircraft routing ⋮ Cutting and packing problems under uncertainty: literature review and classification framework

Uses Software

• Knapsack
• SUTIL

Cites Work

• Unnamed Item
• Disruption management in the airline industry-concepts, models and methods
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• Online algorithms: a survey
• Stochastic linear programming. Models, theory, and computation
• Project scheduling under uncertainty: survey and research potentials
• The empirical behavior of sampling methods for stochastic programming
• Constraint-specific recovery network for solving airline recovery problems
• Lectures on Modern Convex Optimization
• The Price of Robustness
• Introduction to Stochastic Programming
• Airline Crew Scheduling with Time Windows and Plane-Count Constraints
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Uncertainty feature optimization: An implicit paradigm for problems with noisy data