GRASP with path relinking for the orienteering problem
In this paper, we address an optimization problem resulting from the combination of...
A taxonomy of line balancing problems and their solutionapproaches
Line balancing belongs to a class of intensively studied combinatorial optimization...
Computing Optimal Steiner Trees in Polynomial Space
Given an n ‐node edge‐weighted graph and a subset of k terminal nodes,...
Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines
Buffer capacity allocation problems for flow‐line manufacturing systems with...
A polynomial case of the cardinality‐constrained quadratic optimization problem
We propose in this paper a fixed parameter polynomial algorithm for the...
Car sequencing is NP‐hard: a short proof
In this note, a new proof is given that the car sequencing (CS) problem is...
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
Comparing and ranking information is an important topic in social and information...
Non‐preemptive speed scaling
We consider the following offline variant of the speed scaling problem introduced by...
Bounded parallel‐batching scheduling with two competing agents
We consider a scheduling problem in which two agents, each with a set of...
Outsourcing and scheduling for two‐machine ordered flow shop scheduling problems
This paper considers a two‐machine ordered flow shop problem, where each job is...
Weighted inverse maximum perfect matching problems under the Hamming distance
Given an undirected network G ( V , E , c ) and a perfect matching M 0 , the inverse...
An adaptive search for the response time variability problem☆
The Response Time Variability Problem (RTVP) is an NP‐hard combinatorial...
Approximation and Tidying–A Problem Kernel for s‐Plex Cluster Vertex Deletion
We introduce the NP‐hard graph‐based data clustering problem s ‐...
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality...
Drawing (Complete) Binary Tanglegrams
A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are...
The Parameterized Complexity of Stabbing Rectangles
The NP‐complete geometric covering problem Rectangle Stabbing is defined as...
On a constant factor approximation for minmax regret problems using a symmetry point scenario
In order to find a robust solution under an unknown linear cost function it will be...
An Exact Exponential Time Algorithm for Power Dominating Set
The Power Dominating Set problem is an extension of the well‐known domination...
Improved Approximation Algorithms for Data Migration
Our work is motivated by the need to manage data items on a collection of storage...
Computing solutions for matching games
A matching game is a cooperative game ( N , v ) defined on a graph G = ( N , E ) with...
On Two Class‐Constrained Versions of the Multiple Knapsack Problem
We study two variants of the classic knapsack problem, in which we need to place items...
Polynomial Time Approximation Schemes for Some Dense Instances of NP‐Hard Optimization Problems
We survey recent results on the existence of polynomial time approximation schemes for...
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint
Sviridenko M I
We consider the MAX SAT problem with the additional constraint that at most P...
Further Thoughts on the Syntenic Distance between Genomes
The syntenic distance between two multi-chromosomal genomes is the minimum number of...
Papers per page: