Results 1 to 10 of about 715,075 (267)
Renormalization for Discrete Optimization [PDF]
Physical Review Letters, 1999 The renormalization group has proven to be a very powerful tool in physics for treating systems with many length scales. Here we show how it can be adapted to provide a new class of algorithms for discrete optimization.
A. Hartmann +17 more
core +6 more sources
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
Tropical Oriented Matroids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes – in much the
Silke Horn
doaj +1 more source
Finance and Economics Discussion Series, 1999 This paper investigates the desirability of adopting a rule in favor of discretionary monetary policy in a model exhibiting Kydland and Prescott's dynamic inconsistency problem. We deviate from earlier work by adopting assumptions regarding policymaker preferences and inflation dynamics that are compatible with empirically motivated models used for ...
Lengwiler, Yvan, Orphanides, Athanasios
openaire +1 more source
Adaptive Cut Selection in Mixed-Integer Linear Programming
Open Journal of Mathematical Optimization, 2023 Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance.
Turner, Mark +3 more
doaj +1 more source
Progress in mathematical programming solvers from 2001 to 2020
EURO Journal on Computational Optimization, 2022 This study investigates the progress made in lp and milp solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today.
Thorsten Koch +3 more
doaj +1 more source
Operations Research Perspectives, 2021 This paper mainly studies two topics: linear complementarity problems for modeling electricity market equilibria and optimization under uncertainty. We consider both perfectly competitive and Nash–Cournot models of electricity markets and study their ...
Anja Kramer +2 more
doaj +1 more source
Optimal Discrete Slicing [PDF]
ACM Transactions on Graphics, 2017 Slicing is the procedure necessary to prepare a shape for layered manufacturing. There are degrees of freedom in this process, such as the starting point of the slicing sequence and the thickness of each slice. The choice of these parameters influences the manufacturing process and its result: The number of slices significantly affects the time needed ...
Alexa, Marc +2 more
openaire +2 more sources
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I [PDF]
Yugoslav Journal of Operations Research, 2014 This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions.
Eremeev Anton V., Kovalenko Julia V.
doaj +1 more source
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II [PDF]
Yugoslav Journal of Operations Research, 2014 This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we
Eremeev Anton V., Kovalenko Julia V.
doaj +1 more source