A Probabilistic Model for Minmax Regret in Combinatorial Optimization

Operations Research - United States
doi 10.1287/opre.2013.1212
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Parallel Scatter Search Approach for the MinMax Regret Location Problem

International Journal of Applied Metaheuristic Computing
ControlStatisticsProbabilityOptimizationDecision SciencesComputational TheorySimulationComputer Science ApplicationsComputational MathematicsMathematicsModeling
2018English

Min–max and Min–max Regret Versions of Combinatorial Optimization Problems: A Survey

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2009English

Research on Logistics Center Optimization Model With Regret Value

Sustainable Development
2016English

Combinatorial Optimization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Combinatorial Optimization

2003English

Consistent Neighborhood Search for Combinatorial Optimization

ISRN Computational Mathematics
2012English

Continuous Optimization and Combinatorial Optimization

Frontiers of Mathematics in China
Mathematics
2009English

A Hybrid Model of Evolutionary Algorithms and Branch-And-Bound for Combinatorial Optimization Problems

English

Gerrymandering as a Combinatorial Optimization Problem

Digitale Welt
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy