Keyword: heuristics

Found 5460 papers in total
Computing Approximate Shortest Paths on Convex Polytopes
Computing Approximate Shortest Paths on Convex Polytopes
2002,
The algorithms for computing a shortest path on a polyhedral surface are slow,...
A Divide‐and‐Conquer Approach to the Minimum k ‐Way Cut Problem
A Divide‐and‐Conquer Approach to the Minimum k ‐Way Cut Problem
2002,
This paper presents algorithms for computing a minimum 3 ‐way cut and a minimum...
A Generalization of AT‐Free Graphs and a Generic Algorithm for Solving Triangulation Problems
A Generalization of AT‐Free Graphs and a Generic Algorithm for Solving Triangulation Problems
2002,
A subset A of the vertices of a graph G is an asteroidal set if for each vertex a...
Instance‐specific multi‐objective parameter tuning based on fuzzy logic
Instance‐specific multi‐objective parameter tuning based on fuzzy logic
2012,
Applied to the symmetric Travelling Salesman Problem and the meta‐heuristic...
A theoretical and empirical investigation on the Lagrangian capacities of the 0‐1 multidimensional knapsack problem
A theoretical and empirical investigation on the Lagrangian capacities of the 0‐1 multidimensional knapsack problem
2012,
We present a novel Lagrangian method to find good feasible solutions in theoretical...
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
2012,
The symmetric quadratic knapsack problem (SQKP), which has several applications in...
A graph‐pair representation and MIP‐model‐based heuristic for the unequal‐area facility layout problem
A graph‐pair representation and MIP‐model‐based heuristic for the unequal‐area facility layout problem
2012,
Owing to its theoretical as well as practical significance, the facility layout...
A school bus scheduling problem
A school bus scheduling problem
2012,
This paper introduces a school bus scheduling problem wherein trips for each school...
Capacitated arc routing problem with deadheading demands
Capacitated arc routing problem with deadheading demands
2012,
Capacitated arc routing problem (CARP) is the determination of vehicle tours that...
An optimization‐based heuristic for the Multi‐objective Undirected Capacitated Arc Routing Problem
An optimization‐based heuristic for the Multi‐objective Undirected Capacitated Arc Routing Problem
2012,
The Multi‐objective Undirected Capacitated Arc Routing Problem (MUCARP) is the...
Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems
Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems
2012,
In this paper we introduce the Personnel Task Scheduling Problem (PTSP) and provide...
Simulation‐based Selectee Lane queueing design for passenger checkpoint screening
Simulation‐based Selectee Lane queueing design for passenger checkpoint screening
2012,
There are two kinds of passenger checkpoint screening lanes in a typical US airport: a...
Fitting piecewise linear continuous functions
Fitting piecewise linear continuous functions
2012,
We consider the problem of fitting a continuous piecewise linear function to a finite...
A mathematical formulation and complexity considerations for the blocks relocation problem
A mathematical formulation and complexity considerations for the blocks relocation problem
2012,
The blocks relocation problem (BRP) may be defined as follows: given a set of...
Improving the efficiency of a best‐first bottom‐up approach for the Constrained 2D Cutting Problem
Improving the efficiency of a best‐first bottom‐up approach for the Constrained 2D Cutting Problem
2012,
This work introduces several improvements in the solution of the Constrained 2D...
Optimizing a dynamic order‐picking process
Optimizing a dynamic order‐picking process
2012,
This research studies the problem of batching orders in a dynamic,...
The optimal allocation of server time slots over different classes of patients
The optimal allocation of server time slots over different classes of patients
2012,
We present a model for assigning server time slots to different classes of patients....
A reference length approach for the 3D strip packing problem
A reference length approach for the 3D strip packing problem
2012,
In the three‐dimensional strip packing problem (3DSP), we are given a container...
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
2012,
Wireless sensor networks involve many different real‐world contexts, such as...
Graph Decomposition for Memoryless Periodic Exploration
Graph Decomposition for Memoryless Periodic Exploration
2012,
We consider a general framework in which a memoryless robot periodically explores all...
On the Hitting Times of Quantum Versus Random Walks
On the Hitting Times of Quantum Versus Random Walks
2012,
The hitting time of a classical random walk (Markov chain) is the time required to...
A Primal‐Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
A Primal‐Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
2012,
We consider the facility location problem with submodular penalties (FLPSP),...
Interval Partitions and Polynomial Factorization
Interval Partitions and Polynomial Factorization
2012,
The fastest algorithms for factoring a univariate polynomial f of degree n over a...
Layered Working‐Set Trees
Layered Working‐Set Trees
2012,
The working‐set bound [Sleator and Tarjan in J. ACM 32(3), 652–686, 1985]...
Papers per page: