Keyword: combinatorial optimization

Found 3184 papers in total
Coordinating multi‐location production and customer delivery
2013,
We study two parallel machine scheduling problems with equal processing time jobs and...
Minimal Time Functions and the Smallest Intersecting Ball Problem with Unbounded Dynamics
2012,
The smallest enclosing circle problem introduced in the nineteenth century by...
An Economic Production Quantity Model for Defective Items with Trapezoidal type Demand Rate
2012,
In this paper, we study the inventory model for defective items with trapezoidal type...
Between a rock and a hard place: the two‐to‐one assignment problem
2012,
We describe the two‐to‐one assignment problem, a problem in between the...
Mathematical modelling and solution of pipeline laying problem
2012,
Developing a general approach to the pipeline laying problem with constraints has both...
Multi‐product lot scheduling with backordering and shelf‐life constraints
2013,
In this paper, we revisit the economic lot scheduling problem (ELSP), where a family...
Water resources management under multi‐parameter interactions: A factorial multi‐stage stochastic programming approach
2013,
The paper proposes a factorial multi‐stage stochastic programming (FMSP)...
A comparison of fixed and dynamic pricing policies in revenue management
2013,
We consider the problem of selling a fixed capacity or inventory of items over a...
Commercial territory design planning with realignment and disjoint assignment requirements
2013,
A territory design problem motivated by a bottled beverage distribution company is...
Impact of product proliferation on the reverse supply chain
2013,
Product variety is one of the most important advantages in highly competitive markets....
The Generalized Covering Salesman Problem
2012,
Given a graph G = ( N , E ), the covering salesman problem (CSP) is to identify the...
Dividing a Territory Among Several Vehicles
2012,
We consider an uncapacitated stochastic vehicle routing problem in which vehicle depot...
The Fixed‐Charge Shortest‐Path Problem
2012,
Consider a network 𝒩 =( N , A ) and associate with each arc e ∈ A a fixed...
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
2012,
This paper presents a simple branch‐and‐bound method based on Lagrangean...
Finite‐Sample Performance of Absolute Precision Stopping Rules
2012,
Absolute precision stopping rules are often used to determine the length of sequential...
Improving container terminal efficiency through emulation
2012,
Container terminals are struggling with a continuously increasing volume and...
Municipal waste collection in Ponte de Lima, Portugal – A vehicle routing application
2012,
Between 40 and 60 per cent of a community's waste management system costs are due to...
Optimization and implementation of a system for allocating services integrated with the Google Maps service
2012,
This article presents a system for solving location problems, which is integrated with...
Single‐machine scheduling with logarithm deterioration
2012,
Traditionally, job processing times are assumed to be known and fixed; however, there...
A revised proof of the optimality for the Kise–Ibaraki–Mine algorithm
2012,
For the problem of scheduling n ‐jobs on one‐machine with agreeable job...
An efficient approximation for minimum energy broadcast in multi‐channel multi‐hop wireless network with directional antennas
2012,
In this paper, We discuss the minimum energy broadcast problem (MEB) in...
Single‐machine scheduling and slack due‐date assignment with aging effect and deteriorating maintenance
2012,
We consider single‐machine scheduling and slack due‐date assignment...
On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
2012,
In this paper, we deal with the unrelated parallel machine scheduling problem in which...
Computational schemes for two exponential servers where the first has a finite buffer
2011,
We consider a system consisting of two not necessarily identical exponential servers...
Papers per page: