Parallel-batch machine problems arise in numerous manufacturing settings from semiconductor manufacturing to printing. They have recently been addressed in constraint programming (CP) via the combination of the novel sequenceEDD global constraint with the existing pack constraint to form the current state-of-the-art approach. In this paper, we present a detailed analysis of the problem and deri...

This paper shows how valid inequalities based on the mixing set can be used in a mixed integer programming (MIP) solver. It discusses the relation of mixing inequalities to flow path and mixed integer rounding inequalities and how currently used separation algorithms already generate cuts implicitly that can be seen as mixing cuts. Further on, it describes two new separation algorithms that gen...

Nurse scheduling is a topic widely studied due to its overall effect on patient care and hospital performance. This research focuses formulating Mixed Integer Programming (MIP) workforce model as nurse rostering problem. The incorporates multiple objectives of individual preference qualification. approached by categorizing nurses into different hierarchical levels based their qualifications pos...

This article investigates the autonomous demand response (ADR) in a building microgrid incorporating photovoltaic (PV) generation and plug-in electric vehicles. Two operation models are introduced this to enhance self-utilization of PV power: 1) mixed integer programming (MIP)-based optimization model; 2) game theoretic model. To avoid disadvantages MIP-based centralized decentralized approach,...

Lifting is a procedure for deriving strong valid inequalities for a closed set from inequalities that are valid for its lower dimensional restrictions. It is arguably one of the most effective ways of strengthening linear programming relaxations of 0–1 programming problems. Wolsey (1977) and Gu et al. (2000) show that superadditive lifting functions lead to sequence independent lifting of valid...

In developing a classification model for assigning observations of unknown class to one of a number of specified classes using the values of a set of features associated with each observation, it is often desirable to the classifier on a limited number of features. Mathematical programming (MP) discriminant analysis methods for developing classification models can be extended for feature select...

In this paper, we consider mixed integer linear programming (MIP) formulations for piecewise linear functions (PLFs) that are evaluated when an indicator variable is turned on. We describe modifications to standard MIP formulations for PLFs with desirable theoretical properties and superior computational performance in this context. © 2013 Elsevier B.V. All rights reserved.

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

We propose a network flow formulation for protein threading and show its equivalence with the shortest path problem on a graph with a very particular structure. The underying Mixed Integer Programming (MIP) model proves to be very appropriate for the protein threading problem–huge real-life instances have been solved in a reasonable time by using only a Mixed Integer Optimizer instead of a spec...

A special ordered set approach for optimizing a discontinuous separable piecewise linear function, This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting galley proof before it is published in its fin...