Keyword: heuristics

Found 5460 papers in total
Solving the clique partitioning problem as a maximally diverse grouping problem
Solving the clique partitioning problem as a maximally diverse grouping problem
2017,
In this paper we show that the clique partitioning problem can be reformulated in an...
A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints
A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints
2017,
This paper considers the well‐known static time‐continuous multiproduct...
A metaheuristic approach to the dominating tree problem
A metaheuristic approach to the dominating tree problem
2017,
This paper considers a recently introduced NP‐hard problem on graphs, called...
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
2017,
In this study, we start from a multi‐source variant of the two‐stage...
Primal‐Dual Algorithms for Precedence Constrained Covering Problems
Primal‐Dual Algorithms for Precedence Constrained Covering Problems
2017,
A covering problem is an integer linear program of type min { c T x ∣ A x ≥ D ,...
Resolving Braess’s Paradox in Random Networks
Resolving Braess’s Paradox in Random Networks
2017,
Braess’s paradox states that removing a part of a network may improve the...
Online Packet-Routing in Grids with Bounded Buffers
Online Packet-Routing in Grids with Bounded Buffers
2017,
We present deterministic and randomized algorithms for the problem of online packet...
On Computing an Optimal Semi-matching
On Computing an Optimal Semi-matching
2017,
A semi‐matching in a bipartite graph G = ( U , V , E ) is a set of edges M...
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
2017,
We consider the problems of finding optimal identifying codes, (open)...
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
2017,
We present several sparsification lower and upper bounds for classic problems in graph...
Improved Algorithms for Distributed Entropy Monitoring
Improved Algorithms for Distributed Entropy Monitoring
2017,
Modern data management systems often need to deal with massive, dynamic and inherently...
On the Approximability of Digraph Ordering
On the Approximability of Digraph Ordering
2017,
Given an n ‐vertex digraph D = ( V , A ) the Max ‐ k ‐ Ordering...
Strong ETH and Resolution via Games and the Multiplicity of Strategies
Strong ETH and Resolution via Games and the Multiplicity of Strategies
2017,
We consider a proof system intermediate between regular Resolution, in which no...
Parameterized Complexity of Sparse Linear Complementarity Problems
Parameterized Complexity of Sparse Linear Complementarity Problems
2017,
In this paper, we study the parameterized complexity of the linear complementarity...
Node, Edge, Arc Routing and Turn Penalties: Multiple Problems–One Neighborhood Extension
Node, Edge, Arc Routing and Turn Penalties: Multiple Problems–One Neighborhood Extension
2017,
This article explores a structural neighborhood decomposition for arc routing...
Optimal Merchandise Testing with Limited Inventory
Optimal Merchandise Testing with Limited Inventory
2017,
We consider the allocation of inventory to stores in a ‘merchandise test,’...
Simplex Algorithm for Countable-State Discounted Markov Decision Processes
Simplex Algorithm for Countable-State Discounted Markov Decision Processes
2017,
We consider discounted Markov decision processes (MDPs) with countably‐infinite...
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
2017,
We present a randomized O (log n /log log n )‐approximation algorithm for the...
Inverse Optimization for the Recovery of Market Structure from Market Outcomes: An Application to the MISO Electricity Market
Inverse Optimization for the Recovery of Market Structure from Market Outcomes: An Application to the MISO Electricity Market
2017,
We propose an inverse optimization‐based methodology to determine market...
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
2017,
Given a set of candidate road projects associated with costs, finding the best subset...
A modified differential evolution-based fuzzy multi-objective approach for clustering
A modified differential evolution-based fuzzy multi-objective approach for clustering
2017,
Many evolutionary‐based metaheuristics have been proposed for minimisation of...
An application of artificial neural network and particle swarm optimisation technique for modelling and optimisation of centreless grinding process
An application of artificial neural network and particle swarm optimisation technique for modelling and optimisation of centreless grinding process
2017,
Centreless grinding operation is widely used in manufacturing industry for its high...
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls
2017,
This article analyzes the Vehicle Routing Problem with Backhauls, where delivery and...
An iterated beam search algorithm for the green vehicle routing problem
An iterated beam search algorithm for the green vehicle routing problem
2017,
Green, or, alternative‐fuel vehicles provide opportunities to improve fleet...
Papers per page: