Distributing the Inter-Pool Moves and Asset Replacement in the Car Rental Business In the car rental business, inter-pool moves and asset replacement are distributed among different pool regions based on changes in seasonal demand. We propose an integer programming model
Roger Lederman, Columbia Business School
Pricing with Markups under Horizontal and Vertical Competition We model a market for a single product that may be composed of sub-products that face horizontal and vertical competition. Each firm, offering all or some portion of the product, adopts a
László Ladányi, IBM Research
Bigger, Better, Faster: update on Cbc, the world’s fastest open-source MIP solver The COIN-OR Branch and Cut (Cbc) is the world’s fastest open-source mixed-integer program solver. In the past year alone, the addition of new heuristics, a 2x increase in
Stefan Heinz, Zuse Institute Berlin
The flexibility of the constraint integer programming solver SCIP SCIP is a constraint integer programming solver. Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming and mixed integer programming (MIP) modeling and solving techniques. The solver SCIP
Xiaoguang Qi, Dawei Yin, Zhenzhen Xue, Brian D. Davison, Computer Science & Engineering, Lehigh University
Choosing your own adventure: Automatic taxonomy expansion to permit many paths A taxonomy organizes concepts or topics in a hierarchical structure. The dmoz Open Directory Project and the Yahoo! Directory are two well known examples which, with the help of
Serge Kruk, Oakland University
Facets of multiple all-different constraints We explore the properties of the comb structure of multiple alldifferent, a ubiquitous constraint in Constraint Programming. We introduce multiple classes of facet-inducing inequalities of the convex hull of integer solutions as well as a
Sanjeeb Dash, IBM Research
The master equality polyhedron In this talk, we discuss the master equality polyhedron (MEP) which generalizes the master polyhedra of Gomory (1969). Gomory introduced master polyhedra and master cyclic group polyhedra as tools to obtain cutting planes for general integer
Oktay Gunluk, IBM Research
On mixing inequalities: rank, closure and cutting plane proofs We study the mixing inequalities which were introduced by Gunluk and Pochet (2001). We show that a mixing inequality which mixes n MIR inequalities has MIR rank at most n if
Eugene Perevalov, Lehigh University
Entropic optimization: a novel framework for optimization/decision making under uncertainty A novel framework for optimization/decision making under uncertainty is proposed. Within this framework, a solution is associated with a map from the set of possible system states (scenarios) and the
Scott Greenhalgh, University of Guelph
Network Equilibrium Problems and Hybrid Dynamical Systems We present a numerical scheme for describing the time evolution of a class of network equilibrium problems. Our method is based on an approach from hybrid dynamical systems and blends in with previous