Min/max optimization
Pseudo-polynomial algorithms for min-max and min-max regret problems
... Keywords: min-max, min-max regret, computational complexity, ...combinatorial optimization problem requires to specify parameters, in particular objective function coefficients, which ...
8
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
... of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...the min-max versions of these problems, using relation- ships between multi-objective and ...
12
Relaxation schemes for min max generalization in deterministic batch mode reinforcement learning
... We study the min max optimization problem introduced in [6] for computing policies for batch mode reinforcement learning in a deterministic setting. This problem is NP-hard. We focus on the two-stage ...
6
Direct-Search for a Class of Stochastic Min-Max Problems
... practice, min-max problems are often solved us- ing gradient-based algorithms, especially simultaneous gradient descent ascent (GDA) that simply alternates between a gradient descent step for x and a gradi- ...
12
Complexity of the min-max (regret) versions of cut problems
... the min-max and min-max regret criteria, stemming from decision theory, to construct solutions hedging against parameters ...In min- max optimization, the aim is to find a ...
11
Prioritized Adaptive Max-Min Fair Residual Bandwidth Allocation for Software-Defined Data Center Networks
... Best Fit Algorithm Besides saving energy, a data center should to take measures to fulfill all Service-Level Agreement SLA requirements, including virtual machine placement ratio which i[r] ...
291
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... combinatorial optimization, the min vertex cover ...of max independent set) and ...where max independent set is polynomially ...for max independent set can be improved in order to ...
26
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier
... Min-Max Edge Orientation Problem. Since Venkateswaran [27] introduced the problem, (centralized) polynomial-time algorithms are known to give optimal solutions for unweighted graphs [3], [21], [27]. ...
12
A MIN-MAX PATH APPROACH FOR BALANCING ROBOTIC ASSEMBLY LINES WITH SEQUENCE-DEPENDENT SETUP TIMES
... KEYWORDS: Line balancing, Robotic, Sequence-dependent setup times, Polynomial case, Min-max path, Metaheuristic. 1 INTRODUCTION We assist nowadays to the growing robotization of all manufacturing systems. ...
11
Interrogation 10 min
... Parmi les formules suivantes, entourez celle qui donne la période d’oscillations du pendule pesant (pour trouver la bonne formule aidez-vous des unités : l est en m et g en m/s²) :.. b[r] ...
2
Beyond C<i>max</i>: an optimization-oriented framework for constraint-based scheduling
... The Optimization-oriented Framework Relaxations in CP-based ...an optimization problems with a B&B algorithm, pruning must also proceed from optimality reasoning: Pruning a node means to discard from ...
13
Min/max time limits and energy penalty of communication scheduling in ring-based ONoC
... For the example presented in this section, we consider a FSR equal to 0.8 nm and, as mentioned before, an optimal repartition of wavelengths onto this interval. Fig. 3. Execution times comparison for min vs ...
7
Dirac-Coulomb operators with general charge distribution. I. Distinguished extension and min-max formulas
... the min-max formulas was shown for one-center Dirac operators in [8] in the domain of the distinguished extension and then in H 1/2 (R 3 ) in [27, ...the min-max methods in H 1/2 (R 3 , C 4 ) ...
33
A Min-Max certainty equivalence principle for non-linear discrete-time control problems
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
16
A max-min principle for the ground state of the Dirac-Fock functional
... One way to deal with this problem, is to restrict the energy functional to the space + E N , + being the projector on the space of positive states of a perturbed Dirac operator H0 +.. No[r] ...
9
Navier-Stokes dynamical shape control : from state derivative to Min-Max principle
... Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex France Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois - [r] ...
61
Max Jacob peintre
... de Max Jacob au reste de sa carrière de peintre : malgré les reproches qu’il a essuyés de la part des surréalistes après sa conversion, aucune rupture ne doit être envisagée ni entre l’ami de Picasso et le dévot ...
17
Feature selection with Rényi min-entropy
... Recently, some advances in the fields of security and privacy have revived the inter- est for the R´enyi min-entropy. The reason is that it models a basic notion of attacker: the (one-try) eavesdropper. Such ...
16
On the probabilistic min spanning tree problem
... combinatorial optimization problem Π becomes another equally deterministic problem Π ′ , the solutions of which have the same feasibility constraints as those of Π but with a different objective function where ...
28