Titlebook: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problem; 8th International Co Tobias Achterber

Presbyopia

人類學(xué)家

Retail Store Workforce Scheduling by Expected Operating Income Maximization,rk, salespeople are no longer only responsible for operating costs, but also contribute to operating revenue. We model the marginal impact of an additional staff by making use of historical sales and payroll data, conditioned on a store-, date- and time-dependent traffic forecast. The expected reven

laparoscopy

anarchist

Upgrading Shortest Paths in Networks,om multicast communication to wildlife habitat conservation. We define the problem in terms of a network with node delays and a set of node upgrade actions, each associated with a cost and an upgraded (reduced) node delay. The goal is to choose a set of upgrade actions to minimize the shortest delay

禍害隱伏

Projection

Branch-Cut-and-Propagate for the Maximum ,-Colorable Subgraph Problem with Symmetry,aximum cardinality. The natural integer programming formulation for this problem exhibits two kinds of symmetry: arbitrarily permuting the color classes and/or applying a non-trivial graph automorphism gives equivalent solutions. It is well known that such symmetries have negative effects on the per

預(yù)兆好

Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problemsthe strong sense. The great deal of interest for this problem, besides its theoretical complexity, is animated by needs of various manufacturing and computing systems. We propose a new approach based on limited discrepancy search to solve the problem. Our method is tested with reference to a propose

煩憂

,On Counting Lattice Points and Chvátal-Gomory Cutting Planes,anes. In particular, we show that counting can be exploited in two ways: (i) to strengthen the cuts separated, e.g., by Gomory classical procedure, and (ii) to heuristically evaluate the effectiveness of those cuts and possibly select only a subset of them. Empirical results on a small set of 0-1 In

收到

Chronic

A Probing Algorithm for MINLP with Failure Prediction by SVM,rocedure that explores the consequences of restricting a variable to a subinterval with the goal of tightening its bounds. We propose a variant of probing where exploration is based on iteratively applying a truncated Branch-and-Bound algorithm. As this approach is computationally expensive, we use