A Persistency Model and Its Applications in Choice Modeling

Given a discrete optimization problem $Z(\mb{\tilde{c}})=\max\{\mb{\tilde{c}}’\mb{x}:\mb{x}\in \mathcal{X}\}$, with objective coefficients $\mb{\tilde{c}}$ chosen randomly from a distribution ${\mathcal{\theta}}$, we would like to evaluate the expected value $E_\theta(Z(\mb{\tilde{c}}))$ and the probability $P_{\mathcal{\theta}}(x^*_i(\mb{\tilde{c}})=k)$ where $x^*(\mb{\tilde{c}})$ is an optimal solution to $Z(\mb{\tilde{c}})$. We call this the persistency problem for a discrete optimization problem under uncertain objective, and $P_{\mathcal{\theta}}(x^*_i(\mb{\tilde{c}})=k)$, the … Read more

Lattice based extended formulations for integer linear equality systems

We study different extended formulations for the set $X =\{x\in\mathbb{Z}^n \mid Ax = Ax^0\}$ in order to tackle the feasibility problem for the set $X_+=X \cap \mathbb{Z}^n_+$. Here the goal is not to find an improved polyhedral relaxation of conv$(X_+)$, but rather to reformulate in such a way that the new variables introduced provide good … Read more

Solving the uncapacitated facility location problem with semi-Lagrangian relaxation

The semi-Lagrangian Relaxation (SLR) method has been introduced in Beltran et al. (2006) to solve the p-median problem. In this paper we apply the method to the Uncapacitated Facility Location (UFL) problem. We perform computational experiments on two main collections of UFL problems with unknown optimal values. On one collection, we manage to solve to … Read more

Efficient Formulations for the Multi-Floor Facility Layout Problem with Elevators

The block layout problem for a multi-floor facility is an important sub class of the facility layout problem with practical applications when the price of land is high or when a compact building allows for more efficient environmental control. Several alternative formulations for the block layout problem of a multi-floor facility are presented, where the … Read more

On a Generalization of the Master Cyclic Group Polyhedron

We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of the polar of the nontrivial facet-defining inequalities for the MEP. This result generalizes similar results for the Master Cyclic Group Polyhedron by Gomory (1969) and for the Master Knapsack Polyhedron … Read more

Probabilistic Choice Models for Product Pricing using Reservation Prices

We consider revenue management models for pricing a product line with several customer segments, working under the assumption that every customer’s product choice is determined entirely by their reservation price. We model the customer choice behavior by several probabilistic choice models and formulate the problems as mixed-integer programming problems. We study special properties of these … Read more

Duality for Mixed-Integer Linear Programs

This paper is a survey of and some minor extensions to the theory of duality for mixed-integer linear programs. The theory of duality for linear programs is well-developed and has been extremely successful in both theory and practice. Much of this broad framework can be extended to MILPs in principle, but this has proven largely … Read more

Capacitated network design using general flow-cutset inequalities

This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), … Read more

A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks

Due to the high computational complexity of exact methods (e.g., integer programming) for routing and wavelength assigment in optical networks, it is beneficial to decompose the problem into a routing task and a wavelength allocation task. However, by this decomposition it is not necessarily possible to obtain a valid wavelength assignment for a given routing … Read more

The Mixing-MIR Set with Divisible Capacities

We study the set $S = \{(x, y) \in \Re_{+} \times Z^{n}: x + B_{j} y_{j} \geq b_{j}, j = 1, \ldots, n\}$, where $B_{j}, b_{j} \in \Re_{+} – \{0\}$, $j = 1, \ldots, n$, and $B_{1} | \cdots | B_{n}$. The set $S$ generalizes the mixed-integer rounding (MIR) set of Nemhauser and Wolsey and … Read more