相关论文: Optimizing the Production Cost of Minting with Mix…

We present a new mixed integer formulation for the discrete informative path planning problem in random fields. The objective is to compute a budget constrained path while collecting measurements whose linear estimate results in minimum…

Supply chain (SC) risk management is influenced by both spatial and temporal attributes of different entities (suppliers, retailers, and customers). Each entity has given capacity and lead time for processing and transporting products to…

The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the…

This paper addresses the problem of managing rotational load shedding schedules for a power distribution network with multiple load zones. An integer optimization problem is formulated to find the optimal number and duration of planned…

Exactly solving multi-objective integer programming (MOIP) problems is often a very time consuming process, especially for large and complex problems. Parallel computing has the potential to significantly reduce the time taken to solve such…

In recent years, the embedding approach for solving switched optimal control problems has been developed in a series of papers. However, the embedding approach, which advantageously converts the hybrid optimal control problem to a classical…

Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised. We focus in this paper, on a variant of bin packing that is…

Quantum state tomography is an indispensable but costly part of many quantum experiments. Typically, it requires measurements to be carried in a number of different settings on a fixed experimental setup. The collected data is often…

As the share of variable renewable energy sources increases in the electricity mix, new solutions are needed to build a flexible and reliable grid. Energy arbitrage with battery storage systems supports renewable energy integration into the…

The under exploitation of the available resources risks to be one of the main problems for a computing center. The growing demand of computational power necessarily entails more complex approaches in the management of the computing…

We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state variable values and the network arcs…

This paper studies four trading algorithms of a professional trader at a multilateral trading facility, observing a realistic two-sided limit order book whose dynamics are driven by the order book events. The identity of the trader can be…

Uncertainty in surgery durations continues to be difficult to account for in operating room scheduling. In particular, it remains complex to accurately incorporate uncertainty in surgical overtime constraints within mixed-integer linear…

At submicron manufacturing technology nodes process variations affect circuit performance significantly. This trend leads to a large timing margin and thus overdesign to maintain yield. To combat this pessimism, post-silicon clock tuning…

Model reduction, which aims to learn a simpler model of the original mixed integer linear programming (MILP), can solve large-scale MILP problems much faster. Most existing model reduction methods are based on variable reduction, which…

In recent years, various means of efficiently detecting changepoints in the univariate setting have been proposed, with one popular approach involving minimising a penalised cost function using dynamic programming. In some situations, these…

Mixed-integer rounding (MIR) cutting planes (cuts) are effective at improving the strength of a linear relaxation for mixed-integer linear programming (MIP) problems. The cuts in this family are derived by aggregating constraints then…

Fashion discounters face the problem of ordering the right amount of pieces in each size of a product. The product is ordered in pre-packs containing a certain size-mix of a product. For this so-called lot-type design problem, a stochastic…

We are concerned with the problem of scheduling $n$ jobs onto $m$ identical machines. Each machine has to be in operation for a prescribed time, and the objective is to minimize the total machine working time. Precisely, let $c_i$ be the…

Real-life parallel machine scheduling problems can be characterized by: (i) limited information about the exact task duration at scheduling time, and (ii) an opportunity to reschedule the remaining tasks each time a task processing is…