Keyword: heuristics

Found 5460 papers in total
A new heuristic for rectangular stock‐cutting problem
A new heuristic for rectangular stock‐cutting problem
2011,
One of the important problems being faced in industry is to find appropriate patterns...
Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning
Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning
2012,
We address an unrelated parallel machine scheduling problem with R‐learning, an...
New model and heuristics for safety stock placement in general acyclic supply chain networks
New model and heuristics for safety stock placement in general acyclic supply chain networks
2012,
We model the safety stock placement problem in general acyclic supply chain networks...
An efficient deterministic heuristic for two‐dimensional rectangular packing
An efficient deterministic heuristic for two‐dimensional rectangular packing
2012,
This paper proposes a deterministic heuristic, a best fit algorithm (BFA), for solving...
Single‐Source Capacitated Multi‐Facility Weber Problem–An iterative two phase heuristic algorithm
Single‐Source Capacitated Multi‐Facility Weber Problem–An iterative two phase heuristic algorithm
2012,
Multi‐Facility Weber Problem (MFWP), also known as continuous...
Exact algorithms for OWA‐optimization in multiobjective spanning tree problems
Exact algorithms for OWA‐optimization in multiobjective spanning tree problems
2012,
This paper deals with the multiobjective version of the optimal spanning tree problem....
Solving the stochastic dynamic lot‐sizing problem through nature‐inspired heuristics
Solving the stochastic dynamic lot‐sizing problem through nature‐inspired heuristics
2012,
We investigate the dynamic lot‐size problem under stochastic and...
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
2012,
This paper presents a new alternative of Lagrangian decomposition based on column...
An effective heuristic algorithm for sum coloring of graphs
An effective heuristic algorithm for sum coloring of graphs
2012,
Given an undirected graph G = ( V , E ) , the minimum sum coloring problem (MSCP) is...
Mathematical models for preemptive shop scheduling problems
Mathematical models for preemptive shop scheduling problems
2012,
More than half a century has passed since Bowman and Dantzig (1959) introduced their...
An aggregation heuristic for large scale p‐median problem
An aggregation heuristic for large scale p‐median problem
2012,
The p ‐median problem (PMP) consists of locating p facilities (medians) in...
Measuring and maximizing resilience of freight transportation networks
Measuring and maximizing resilience of freight transportation networks
2012,
In assessing a network's potential performance given possible future disruptions, one...
The hill detouring method for minimizing hinging hyperplanes functions
The hill detouring method for minimizing hinging hyperplanes functions
2012,
This paper studies the problem of minimizing hinging hyperplanes (HH) which is a...
Efficient Estimation of an Additive Quantile Regression Model
Efficient Estimation of an Additive Quantile Regression Model
2011,
In this paper, two non-parametric estimators are proposed for estimating the...
Efficient Covariance Estimation for Asynchronous Noisy High-Frequency Data
Efficient Covariance Estimation for Asynchronous Noisy High-Frequency Data
2011,
We focus on estimating the integrated covariance of log-price processes in the...
Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
2011,
Consideration was given to estimation of the eigenvector corresponding to the greatest...
Iterated local search and very large neighborhoods for the parallel‐machines total tardiness problem
Iterated local search and very large neighborhoods for the parallel‐machines total tardiness problem
2012,
We present computational results with a heuristic algorithm for the parallel machines...
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
2012,
In this paper we consider the well‐known single machine scheduling problem with...
A honey‐bee mating optimization algorithm for educational timetabling problems
A honey‐bee mating optimization algorithm for educational timetabling problems
2012,
In this work, we propose a variant of the honey‐bee mating optimization...
Adaptive policies for multi‐mode project scheduling under uncertainty
Adaptive policies for multi‐mode project scheduling under uncertainty
2012,
In this paper we propose an adaptive model for multi‐mode project scheduling...
Geometry Helps in Bottleneck Matching and Related Problems
Geometry Helps in Bottleneck Matching and Related Problems
2001,
Let A and B be two sets of n objects in ℝ d , and let Match be a...
Efficient Reorganization of Binary Search Trees
Efficient Reorganization of Binary Search Trees
2001,
We consider the problem of maintaining a binary search tree ({ bst }) that minimizes...
An Efficient Output‐Size Sensitive Parallel Algorithm for Hidden‐Surface Removal for Terrains
An Efficient Output‐Size Sensitive Parallel Algorithm for Hidden‐Surface Removal for Terrains
2001,
We describe an efficient parallel algorithm for hidden‐surface removal for...
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
2001,
The problem of searching for mobile intruders in a polygonal region by mobile...
Papers per page: