Search Results - subject:"Mixed Integer Programming"

Primal separation and approximation for the {0,1/2}-closure

Brandl, Lukas; Schulz, Andreas S. - In: Operations research letters : a journal of INFORMS … 57 (2024), pp. 1-6

Persistent link: https://www.econbiz.de/10015338896

On a variant of the change-making problem

Letchford, Adam N.; Cheng, Licong - In: Operations research letters : a journal of INFORMS … 57 (2024), pp. 1-3

Persistent link: https://www.econbiz.de/10015339138

Sparse multiple index models for high-dimensional nonparametric forecasting

Palihawadana, Nuwani K.; Hyndman, Rob J.; Wang, Xiaoqian - 2024

Persistent link: https://www.econbiz.de/10015073818

Optimal forecast reconciliation with time series selection

Wang, Xiaoqian; Hyndman, Rob J.; Wickramasuriya, Shanika L. - 2024

Persistent link: https://www.econbiz.de/10014534120

Configuring Mixed-Integer Programming Solvers for Large-Scale Instances

Kemminer, Robin; Lange, Jannick; Kempkes, Jens Peter; … - In: Operations Research Forum 5 (2024) 2

runtime or maximal solution quality on specified instance sets. Mixed-integer programming (MIP) solvers pose a particular …

Persistent link: https://www.econbiz.de/10015399580

An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems

Bökler, Fritz; Parragh, Sophie N.; Sinnl, Markus; … - In: Mathematical Methods of Operations Research 100 (2024) 1, pp. 263-290

In this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices) as well as the facets of the Edgeworth–Pareto hull. We note that...

Persistent link: https://www.econbiz.de/10015400895

Designing sustainable diet plans by solving triobjective integer programs

Benvenuti, Luca; De Santis, Marianna; Patria, Daniele - In: Mathematical methods of operations research : ZOR 100 (2024) 3, pp. 703-721

Persistent link: https://www.econbiz.de/10015195202

Locally greedy characterizations of interim allocations

Zheng, Charles Zhoucheng - 2024

The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...

Persistent link: https://www.econbiz.de/10015410993

An iterated greedy algorithm for the planning of yarn-dyeing boilers

Demir, Yunus - In: International transactions in operational research : a … 31 (2024) 1, pp. 115-139

Persistent link: https://www.econbiz.de/10014430432

Multi-objective optimization of the maritime cargo routing and scheduling problem

Santos, Pietro Tiaraju Giavarina dos; Borenstein, Denis - In: International transactions in operational research : a … 31 (2024) 1, pp. 221-245

Persistent link: https://www.econbiz.de/10014430479