Results 81 to 90 of about 38,337 (244)
Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms
Decision Sciences, EarlyView.Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham +2 more
wiley +1 more source
Energies, 2020 This paper presents the optimal scheduling of a diesel generator and an energy storage system (ESS) while using a detailed battery ESS energy efficiency model. Optimal scheduling has been hampered to date by the nonlinearity and complexity of the battery
Rae-Kyun Kim +3 more
doaj +1 more source
International Transactions in Operational Research, EarlyView.Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source
An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
Mathematics, 2018 Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications.
Tamer F. Abdelmaguid
doaj +1 more source
Robustness Verification for Classifier Ensembles
, 2020 We give a formal verification procedure that decides whether a classifier ensemble is robust against arbitrary randomized attacks. Such attacks consist of a set of deterministic attacks and a distribution over this set.
Gross, Dennis +3 more
core
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
International Transactions in Operational Research, EarlyView.Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel +2 more
wiley +1 more source
Abduction-Based Explanations for Machine Learning Models
, 2018 The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand.
Ignatiev, Alexey +2 more
core +1 more source
CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction
Mixed-Integer Linear Programming (MILP) is a cornerstone of combinatorial optimization, yet solving large-scale instances remains a significant computational challenge. Recently, Graph Neural Networks (GNNs) have shown promise in accelerating MILP solvers by predicting high-quality solutions. However, we identify that existing methods misalign with the
Pu, Tianle +7 more
openaire +2 more sources
Bridging k-sum and CVaR optimization in MILP [PDF]
Computers & Operations Research, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlo Filippi +2 more
openaire +2 more sources
International Transactions in Operational Research, EarlyView.Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz +3 more
wiley +1 more source