Keyword: combinatorial optimization

Found 3184 papers in total
Generating highly balanced sudoku problems as hard problems
Generating highly balanced sudoku problems as hard problems
2011,
Sudoku problems are some of the most known and enjoyed pastimes, with a never...
Vehicle routing with compartments: applications, modelling and heuristics
Vehicle routing with compartments: applications, modelling and heuristics
2011,
Despite the vast amount of literature about vehicle routing problems, only very little...
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
2011,
This paper presents the SR‐GCWS‐CS probabilistic algorithm that combines...
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...
An Iterative Exact Solution for the Dual Power Management Problem in Wireless Sensor Network
An Iterative Exact Solution for the Dual Power Management Problem in Wireless Sensor Network
2011,
We study the dual power management problem in wireless sensor networks. Given a...
Addressing a nonlinear fixed‐charge transportation problem using a spanning tree‐based genetic algorithm
Addressing a nonlinear fixed‐charge transportation problem using a spanning tree‐based genetic algorithm
2010,
In this paper, we consider the fixed‐charge transportation problem (FCTP) in...
On duality and fractionality of multicommodity flows in directed networks
On duality and fractionality of multicommodity flows in directed networks
2011,
In this paper we address a topological approach to multiflow (multicommodity flow)...
The empirical analysis of the N‐bilateral optimized combinatorial auction model
The empirical analysis of the N‐bilateral optimized combinatorial auction model
2009,
This study proposes a new and highly efficient dynamic combinatorial auction...
Optimizing financial and physical assets with chance‐constrained programming in the electrical industry
Optimizing financial and physical assets with chance‐constrained programming in the electrical industry
2011,
This paper deals with a Chance‐Constrained Programming formulation and...
A Parallel Algorithm for the Vehicle Routing Problem
A Parallel Algorithm for the Vehicle Routing Problem
2011,
The vehicle routing problem (VRP) is a difficult and well‐studied combinatorial...
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
2011,
The Planar Feedback Vertex Set problem asks whether an n ‐vertex planar graph...
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...
A branch‐and‐bound algorithm for hard multiple knapsack problems
A branch‐and‐bound algorithm for hard multiple knapsack problems
2011,
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem....
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
2011,
Motivated by the need for succinct representations of all ‘small’...
Adaptive memory programming for matrix bandwidth minimization
Adaptive memory programming for matrix bandwidth minimization
2011,
In this paper we explore the influence of adaptive memory in the performance of...
One‐Dimensional Carousel Storage Problems: Applications, Review and Generalizations
One‐Dimensional Carousel Storage Problems: Applications, Review and Generalizations
2010,
In this paper we focus on the problems of one‐dimensional storage location and...
Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems
Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems
2010,
Order based combinatorial optimization problems usually require decomposition to work...
A Fully Distributed Lagrangean Solution for a Peer‐to‐Peer Overlay Network Design Problem
A Fully Distributed Lagrangean Solution for a Peer‐to‐Peer Overlay Network Design Problem
2011,
Peer‐to‐peer (P2P) computing already accounts for a large part of the...
Constrained Minimum‐k‐Star Clustering and its application to the consolidation of farmland
Constrained Minimum‐k‐Star Clustering and its application to the consolidation of farmland
2011,
The present paper introduces and studies a new combinatorial clustering model for the...
A job‐shop problem with one additional resource type
A job‐shop problem with one additional resource type
2011,
We consider a job‐shop scheduling problem with n jobs and the constraint that...
BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering
BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering
2010,
The genetic algorithm BIANCA, developed for design and optimisation of composite...
Integrating heuristic information into exact methods: The case of the vertex p-centre problem
Integrating heuristic information into exact methods: The case of the vertex p-centre problem
2010,
We solve the vertex p-centre problem optimally using an exact method that considers...
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
2010,
In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach,...
On the max-weight edge coloring problem
On the max-weight edge coloring problem
2010,
We study the following generalization of the classical edge coloring problem: Given a...
Papers per page: