Results 51 to 60 of about 14,146 (120)

Approximate Convex Optimization by Online Game Playing

open access: yes, 2006
Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $\epsilon$ approximate solution is proportional to $\frac{1}{\epsilon^2 ...
Hazan, Elad
core   +2 more sources

GAMES: A new Scenario for Software and Knowledge Reuse

open access: yes, 1997
Games are a well-known test bed for testing search algorithms and learning methods, and many authors have presented numerous reasons for the research in this area. Nevertheless, they have not received the attention they deserve as software projects.
Estévez Garrido, U.D.   +3 more
core  

A guide to formulating fairness in an optimization model. [PDF]

open access: yesAnn Oper Res, 2023
Xinying Chen V, Hooker JN.
europepmc   +1 more source

A multi-objective supplier selection framework based on user-preferences. [PDF]

open access: yesAnn Oper Res, 2022
Toffano F   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy