Browsing by Keywords "Integer programming"
Now showing items 120 of 64

Algorithms for some discrete location problems
(Bilkent University, 200309) 
Analysis of Lagrangian lower bounds for a graph partitioning problem
(Institute for Operations Research and the Management Sciences (INFORMS), 1999)Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations ... 
Analytical loading models in flexible manufacturing systems
(Elsevier, 1993)It would be difficult to efficiently implement a manufacturing system without solving its design and operational problems. Based on this framework, a system configuration and tooling problem is modeled. The model turns out ... 
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(Institute of Industrial Engineers, 2007)The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ... 
Binary integer formulation for mixedmodel assembly line balancing problem
(Pergamon Press, 19980401)The assembly line balancing problem has been a focus of interest to the academicians of production/operations management for the last 40 years. Although there are numerous studies published on the various aspects of the ... 
A branch and price approach for routing and refueling station location model
(Elsevier, 2016)The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest ... 
A branchandcut algorithm for twolevel survivable network design problems
(Elsevier, 2016)This paper approaches the problem of designing a twolevel network protected against singleedge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of ... 
A branchandprice algorithm for the vehicle routing problem with roaming delivery locations
(Elsevier Ltd, 2017)We study the vehicle routing problem with roaming delivery locations in which the goal is to find a leastcost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered ... 
Code scheduling for optimizing parallelism and data locality
(Springer, 20100809)As chip multiprocessors proliferate, programming support for these devices is likely to receive a lot of attention in the near future. Parallelism and data locality are two critical issues in a chip multiprocessor environment. ... 
A comparative study of computational procedures for the resource constrained project scheduling problem
(Elsevier, 1994)Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ... 
Comparison of the formulations for a hubandspoke network design problem under congestion
(Elsevier, 2016)In this paper, we study the hub location problem with a powerlaw congestion cost and propose an exact solution approach. We formulate this problem in a conic quadratic form and use a strengthening method which rests on ... 
Compromising system and user interests in shelter location and evacuation planning
(Elsevier Ltd, 2015)Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority's point of view, the ... 
Constrained mincut replication for Kway hypergraph partitioning
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)Replication is a widelyused technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ... 
Design of translucent optical networks: Partitioning and restoration
(Kluwer, 2004)We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning ... 
Designing a road network for hazardous materials shipments
(Elsevier, 2007)We consider the problem of designating hazardous materials routes in and through a major population center. Initially, we restrict our attention to a minimally connected network (a tree) where we can predict accurately the ... 
The discrete resource allocation problem in flow lines
(Institute for Operations Research and the Management Sciences (INFORMS), 1995)In this paper we address the discrete resource allocation problem in a deterministic flow line. We assume that the processing times are convex and noningcreasing in the amount of resources allocated to the machines. We ... 
Double bound method for solving the pcenter location problem
(Elsevier, 2013)We give a review of existing methods for solving the absolute and vertex restricted pcenter problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ... 
Dynamic lot sizing with multiple suppliers, backlogging and quantity discounts
(Elsevier Ltd, 2017)This paper studies the dynamic lot sizing problem with supplier selection, backlogging and quantity discounts. Two known discount types are considered separately, incremental and allunits quantity discounts. Mixed integer ... 
Energy minimizing vehicle routing problem
(Springer, 2007)This paper proposes a new cost function based on distance and load of the vehicle for the Capacitated Vehicle Routing Problem. The vehiclerouting problem with this new loadbased cost objective is called the Energy ... 
An equipment replacement problem with dynamic production planning and capacity considerations
(Taylor & Francis, 1996)In this paper, we propose a 01 integer programming formulation for an equipment replacement problem in which the demand of a product varies from period to period and different types of equipment with different production ...