Robust discrete optimization and its applications
From MaRDI portal
(Redirected from Publication:1353370)
1-median location problem on a treeBenders decompositionbranch-and-bounddecision makingflowshop schedulinglocation decisionpolynomially solvable problemsrobust discrete optimizationrobust network designrobustness
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Integer programming (90C10) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(only showing first 100 items - show all)- A new model for path planning with interval data
- Some tractable instances of interval data minmax regret problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- A survey on metaheuristics for stochastic combinatorial optimization
- Robust improvement schemes for road networks under demand uncertainty
- A polynomial solvable minimum risk spanning tree problem with interval data
- Combinatorial optimization in system configuration design
- The minimum spanning tree problem with fuzzy costs
- Two-stage flexible-choice problems under uncertainty
- Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Maximizing the net present value of a project under uncertainty
- Robust placement of sensors in dynamic water distribution systems
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- Robustness in operational research and decision aiding: a multi-faceted issue
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- The design of robust value-creating supply chain networks: a critical review
- Models for robust tactical planning in multi-stage production systems with uncertain demands
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Geometric methods to solve max-ordering location problems
- Minmax regret linear resource allocation problems.
- Robust discrete optimization and network flows
- A branch and bound algorithm for the robust shortest path problem with interval data.
- On the complexity of the robust spanning tree problem with interval data
- Algorithms for the robust 1-center problem on a tree
- Minmax regret solutions for minimax optimization problems with uncertainty
- An exact algorithm for the fuzzy p-median problem
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- A VNS-LP algorithm for the robust dynamic maximal covering location problem
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- MIP-based approaches for robust storage loading problems with stacking constraints
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- Minmax regret combinatorial optimization problems with investments
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Characterizations for optimality conditions of general robust optimization problems
- An improved algorithm for the minmax regret path centdian problem on trees
- Shortest paths with shortest detours. A biobjective routing problem
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- The probabilistic \(p\)-center problem: planning service for potential customers
- Variable-sized uncertainty and inverse problems in robust optimization
- A survey on risk-averse and robust revenue management
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- Multi-objective optimization using statistical models
- Robust multiobjective optimization with application to Internet routing
- A unified characterization of multiobjective robustness via separation
- Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
- Robust single machine scheduling with a flexible maintenance activity
- Formulation and algorithms for the robust maximal covering location problem
- Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market
- The Benders decomposition algorithm: a literature review
- A unified approach to uncertain optimization
- A biobjective approach to recoverable robustness based on location planning
- Robust multiobjective portfolio optimization: A minimax regret approach
- Scenario-based portfolio model for building robust and proactive strategies
- Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Robust scheduling on a single machine to minimize total flow time
- Project scheduling under uncertainty: survey and research potentials
- Facility location problems with uncertainty on the plane
- Robust storage assignment in stack- and queue-based storage systems
- Distributionally robust discrete optimization with entropic Value-at-Risk
- Robust integer programming
- Approximability of the robust representatives selection problem
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- A novel robust fuzzy stochastic programming for closed loop supply chain network design under hybrid uncertainty
- On scenario aggregation to approximate robust combinatorial optimization problems
- Strategic facility location: A review
- Robust and neutral methods for aggregating preferences into an outranking relation
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Interval data minmax regret network optimization problems
- Consistency stability intervals for a judgement in AHP decision support systems
- Multiobjective solution of the uncapacitated plant location problem
- The construction of stable project baseline schedules
- An exact algorithm for the robust shortest path problem with interval data
- Executing production schedules in the face of uncertainties: a review and some future directions
- Computing knapsack solutions with cardinality robustness
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- Linear programming with uncertain data: some extensions to robust optimization
- On the probabilistic min spanning tree problem
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Robust winner determination in positional scoring rules with uncertain weights
- A two-stage robust model for a reliable p-center facility location problem
This page was built for publication: Robust discrete optimization and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1353370)
