Keyword: heuristics

Found 5460 papers in total
Generalized McCormick relaxations
Generalized McCormick relaxations
2011,
Convex and concave relaxations are used extensively in global optimization algorithms....
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
2011,
Let G =( VG , AG ) be a digraph and let S ⊔ T be a bipartition of VG . A...
CLAP: Collaborative pattern mining for distributed information systems
CLAP: Collaborative pattern mining for distributed information systems
2011,
The purpose of data mining from distributed information systems is usually threefold:...
Combination of sources of evidence with different discounting factors based on a new dissimilarity measure
Combination of sources of evidence with different discounting factors based on a new dissimilarity measure
2011,
The sources of evidence may have different reliability and importance in real...
Super cyclically edge connected transitive graphs
Super cyclically edge connected transitive graphs
2011,
A cyclic edge‐cut of a graph G is an edge set, the removal of which separates...
Revised GRASP with path‐relinking for the linear ordering problem
Revised GRASP with path‐relinking for the linear ordering problem
2011,
The linear ordering problem (LOP) is an 𝒩𝒫 ‐hard combinatorial...
On domination number of Cartesian product of directed paths
On domination number of Cartesian product of directed paths
2011,
Let γ ( G ) denote the domination number of a digraph G and let P m □ P n...
Improved floor‐planning of graphs via adjacency‐preserving transformations
Improved floor‐planning of graphs via adjacency‐preserving transformations
2011,
Let G =( V , E ) and G ′=( V ′, E ′) be two graphs, an...
SIRALINA: efficient two‐steps heuristic for storage optimisation in single period task scheduling
SIRALINA: efficient two‐steps heuristic for storage optimisation in single period task scheduling
2011,
In this paper, we study the general problem of one‐dimensional periodic task...
Minimum d‐blockers and d‐transversals in graphs
Minimum d‐blockers and d‐transversals in graphs
2011,
We consider a set V of elements and an optimization problem on V : the search for a...
An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs
An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs
2011,
This paper studies two tactical level decision problems arising in transshipment hubs:...
Covering models and optimization techniques for emergency response facility location and planning: a review
Covering models and optimization techniques for emergency response facility location and planning: a review
2011,
With emergencies being, unfortunately, part of our lives, it is crucial to efficiently...
Worst‐case behavior of simple sequencing rules in flow shop scheduling with general position‐dependent learning effects
Worst‐case behavior of simple sequencing rules in flow shop scheduling with general position‐dependent learning effects
2011,
A real industrial production phenomenon, referred to as learning effects, has drawn...
An optimization model and a solution algorithm for the many‐to‐many car pooling problem
An optimization model and a solution algorithm for the many‐to‐many car pooling problem
2011,
Car pooling is one method that can be easily instituted and can help to resolve a...
Controlling job arrivals with processing time windows into Batch Processor Buffer
Controlling job arrivals with processing time windows into Batch Processor Buffer
2011,
We consider a two‐stage manufacturing system composed of a batch processor and...
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
2011,
We study the stochastic online scheduling on m uniform machines with the objective to...
Genetic Tabu search for robust fixed channel assignment under dynamic traffic data
Genetic Tabu search for robust fixed channel assignment under dynamic traffic data
2011,
The contribution of this work is twofold. Firstly, we introduce a new channel...
On solving Linear Complementarity Problems by DC programming and DCA
On solving Linear Complementarity Problems by DC programming and DCA
2011,
In this paper, we consider four optimization models for solving the Linear...
Generalized Additive Models for Zero-Inflated Data with Partial Constraints
Generalized Additive Models for Zero-Inflated Data with Partial Constraints
2011,
Zero-inflated data abound in ecological studies as well as in other scientific fields....
Stock management in the presence of significant measurement delays
Stock management in the presence of significant measurement delays
2011,
The stock management studies in the system dynamics literature implicitly or...
Adjoint‐based optimal control using meshfree discretizations
Adjoint‐based optimal control using meshfree discretizations
2011,
The paper at hand presents a combination of optimal control approaches for PDEs with...
Attracting cycles for the relaxed Newton's method
Attracting cycles for the relaxed Newton's method
2011,
We study the relaxed Newton’s method applied to polynomials. In particular, we...
An Improved Dynamic Programming Decomposition Approach for Network Revenue Management
An Improved Dynamic Programming Decomposition Approach for Network Revenue Management
2011,
We consider a nonlinear nonseparable functional approximation to the value function of...
Approximation algorithms for multicast routing in ad hoc wireless networks
Approximation algorithms for multicast routing in ad hoc wireless networks
2011,
Energy efficient multicast problem is one of important issues in ad hoc networks. In...
Papers per page: