Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities

A model for Nash-Cournot oligopolistic markets with concave cost functions and a differentiated commodity is analysed. Equilibrium states are characterized through Ky Fan inequalities. Relying on the minimization of a suitable merit function, a general algorithmic scheme for solving them is provided. Two concrete algorithms are therefore designed that converge under suitable convexity and monotonicity … Read more

A Stochastic Programming Approach for Electric Vehicle Charging Network Design

Advantages of electric vehicles (EV) include reduction of greenhouse gas and other emissions, energy security, and fuel economy. The societal benefits of large-scale adoption of EVs cannot be realized without adequate deployment of publicly accessible charging stations. We propose a two-stage stochastic programming model to determine the optimal network of charging stations for a community … Read more

Optimal Price Zones of Electricity Markets: A Mixed-Integer Multilevel Model and Global Solution Approaches

Mathematical modeling of market design issues in liberalized electricity markets often leads to mixed-integer nonlinear multilevel optimization problems for which no general-purpose solvers exist and which are intractable in general. In this work, we consider the problem of splitting a market area into a given number of price zones such that the resulting market design … Read more

The Robust Uncapacitated Lot Sizing Model with Uncertainty Range

We study robust versions of the uncapacitated lot sizing problem, where the demand is subject to uncertainty. The robust models are guided by three parameters, namely, the total scaled uncertainty budget, the minimum number of periods in which one would like the demand to be protected against uncertainty, and the minimum scaled protection level per … Read more

The Selective Traveling Salesman Problem with Draught Limits

This paper introduces the Selective Traveling Salesman Problem with Draught Limits, an extension of Traveling Salesman Problem with Draught Limits, wherein the goal is to design maximal profit tour respecting draught limit constraints of the visited ports. We propose a mixed integer linear programming formulation for this problem. The proposed mixed integer program is used … Read more

An optimization-based approach for delivering radio-pharmaceuticals to medical imaging centers

It is widely recognized that early diagnosis of most types of cancers can increase the chances of full recovery or substantially prolong the life of patients. Positron Emission Tomography (PET) has become the standard way to diagnose many types of cancers by generating high quality images of the affected organs. In order to create an … Read more

Recent Progress Using Matheuristics for Strategic Maritime Inventory Routing

This paper presents an extensive computational study of simple, but prominent matheuristics (i.e., heuristics that rely on mathematical programming models) to fi nd high quality ship schedules and inventory policies for a class of maritime inventory routing problems. Our computational experiments are performed on a set of the publicly available MIRPLib instances. This class of inventory … Read more

Flow formulations for curriculum-based course timetabling

In this paper we present two mixed-integer programming formulations for the curriculum based course timetabling problem (CTT). We show that the formulations contain underlying network structures by dividing the CTT into two separate models and then connect the two models using flow formulation techniques. The first mixed-integer programming formulation is based on an underlying minimum … Read more

Automated timetabling for small colleges and high schools using huge integer programs

We formulate an integer program to solve a highly constrained academic timetabling problem at the United States Merchant Marine Academy. The IP instance that results from our real case study has approximately both 170,000 rows and columns and solves to near optimality in 12 hours, using a commercial solver. Our model is applicable to both … Read more

New Constraints and Features for the University Course Timetabling Problem

The university course timetabling problem deals with the task of scheduling lectures of a set of university courses into a given number of rooms and time periods, taking into account various hard and soft constraints. The goal of the International Timetabling Competitions ITC2002 and ITC2007 was to establish models for comparison that cover the most … Read more