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

European Journal of Operational Research- Netherlands

doi 10.1016/j.ejor.2008.09.012

Full Text

Abstract

Available in

Date

Authors

Publisher

Elsevier BV

Related search

Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Local Approximability of Max-Min and Min-Max Linear Programs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2010English

Facility Location Problem Under Users With Two Type Criteria, Min-Max and Max-Min

International Journal of Japan Association for Management Systems
2015English

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2015English

A Min-Max Theorem on Tournaments

SIAM Journal on Computing
MathematicsComputer Science
2007English

( Max , Min )-Convolution and Mathematical Morphology

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

The Aggregate Homotopy Method for Multi-Objective Max-Min Problems

International Journal of Image, Graphics and Signal Processing
2011English

Numerical Solution for Min-Max Shape Optimization Problems. (Minimum Design of Maximum Stress and Displacement).

JSME International Journal Series A
1998English

Min- And Max-Entropy in Infinite Dimensions

Communications in Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy