Journal: 4OR

Found 137 papers in total
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
2011,
In this paper we study the Resource Constrained Project Scheduling Problem (RCPSP)...
Locating a general minisum ‘circle’ on the plane
Locating a general minisum ‘circle’ on the plane
2011,
We approximate a set of given points in the plane by the boundary of a convex and...
The minimal cone for conic linear programming
The minimal cone for conic linear programming
2011,
It is known that the minimal cone for the constraint system of a conic linear...
Utilizing the information theory of entropy to solve an off‐line inspection problem
Utilizing the information theory of entropy to solve an off‐line inspection problem
2011,
This study presents an off‐line inspection problem for a batch produced from a...
Enhanced mixed integer programming techniques and routing problems
Enhanced mixed integer programming techniques and routing problems
2011,
This is a summary of the author’s PhD thesis supervised by Andrea Lodi and Paolo...
Solving scheduling problems from high‐level models
Solving scheduling problems from high‐level models
2011,
This is the summary of the author’s PhD thesis supervised by Yves Deville and...
Solving real‐world vehicle routing problems in uncertain environments
Solving real‐world vehicle routing problems in uncertain environments
2011,
This is a summary of the Ph.D. thesis defended by the author in December 2009 at...
On the complexity of a bundle pricing problem
On the complexity of a bundle pricing problem
2011,
We consider the problem of pricing items in order to maximize the revenue obtainable...
Solution approach to infinite linear programming problem with capacity constraints
Solution approach to infinite linear programming problem with capacity constraints
2011,
The purpose of this article is to investigate a kind of infinite linear programming...
Channel coordination with manufacturer’s return policies within a newsvendor framework
Channel coordination with manufacturer’s return policies within a newsvendor framework
2011,
The saliency of returns in today’s business world is unquestionable, in such...
LocalSolver 1.x: a black‐box local‐search solver for 0‐1 programming
LocalSolver 1.x: a black‐box local‐search solver for 0‐1 programming
2011,
This paper introduces LocalSolver 1.x, a black‐box local‐search solver...
Political districting: from classical models to recent approaches
Political districting: from classical models to recent approaches
2011,
The political districting problem has been studied since the 60s and many different...
Metaheuristics for multiobjective optimisation
Metaheuristics for multiobjective optimisation
2011,
This work deals with the design, implementation and experimental analysis of...
Combinatorial and robust optimisation models and algorithms for railway applications
Combinatorial and robust optimisation models and algorithms for railway applications
2011,
Railway systems represent a challenging area for operations research, especially when...
Simulation and optimisation of intermodal barge transport networks
Simulation and optimisation of intermodal barge transport networks
2011,
This work deals with two key aspects in the competitiveness of intermodal transport...
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
2011,
This paper introduces a large neighbourhood search heuristic for an airline recovery...
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
2011,
Let T = ( V , A ) be a directed tree. Given a collection 𝒫 of dipaths on T , we...
An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser’s approach
An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser’s approach
2011,
Recently, we described a generalization of Rosser’s algorithm for a single...
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
2011,
The traveling repairman problem is a customer‐centric routing problem, in which...
Airport runway scheduling
Airport runway scheduling
2011,
Airport runway optimization is an ongoing challenge for air traffic controllers. Since...
Scheduling UET‐tasks on a star network: complexity and approximation
Scheduling UET‐tasks on a star network: complexity and approximation
2011,
In this article we investigate complexity and approximation on a processor network...
A fast heuristic for a three‐dimensional non‐convex domain loading problem
A fast heuristic for a three‐dimensional non‐convex domain loading problem
2011,
In this paper we tackle a three‐dimensional non‐convex domain loading...
Functional optimization by variable‐basis approximation schemes
Functional optimization by variable‐basis approximation schemes
2011,
Functional optimization problems arising in Operations Research are investigated. In...
Stochastic hybrid simulation
Stochastic hybrid simulation
2011,
This is a summary of the author’s PhD thesis supervised by Bart Scheers and...
Papers per page: