Keyword: combinatorial optimization

Found 3184 papers in total
A decision support system for quayside operations in a container terminal
A decision support system for quayside operations in a container terminal
2014,
Port operations are influenced by terminal operators and shipping companies. Operating...
A heuristic algorithm for the university course timetabling problems by considering measure index: a case study
A heuristic algorithm for the university course timetabling problems by considering measure index: a case study
2014,
University timetabling problems, particularly the timetables of courses and...
Optimal inventory rationing policy under service differentiation for multiple customer classes with deterministic demand
Optimal inventory rationing policy under service differentiation for multiple customer classes with deterministic demand
2014,
In this paper, we consider inventory rationing policies for a single product with...
JIT-scheduling in unrelated parallel-machine environment with aging effect and multi-maintenance activities
JIT-scheduling in unrelated parallel-machine environment with aging effect and multi-maintenance activities
2014,
In this paper, at first we present a new integer linear programming (ILP)...
Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time
Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time
2014,
This paper deals with the development and analysis of hybrid genetic algorithms for...
A neuro-fuzzy regression approach for estimation and optimisation of gasoline consumption
A neuro-fuzzy regression approach for estimation and optimisation of gasoline consumption
2014,
The purpose of the present study is to forecast the gasoline consumption of Iran. To...
A bi-objective stochastic single facility location model for a supermarket
A bi-objective stochastic single facility location model for a supermarket
2014,
Selecting a new location is vital for retail stores such as chain supermarkets and can...
Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuristics
Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuristics
2011,
The population haplotype inference problem based on the pure parsimony criterion...
Optimal inspection policy for three-state systems monitored by control charts
Optimal inspection policy for three-state systems monitored by control charts
2011,
This paper presents the formulations of the expected long‐run cost per time...
Scheduling with deteriorating jobs and learning effects
Scheduling with deteriorating jobs and learning effects
2011,
This paper studies a single machine scheduling problem simultaneously with...
On the Grundy and b-Chromatic Numbers of a Graph
On the Grundy and b-Chromatic Numbers of a Graph
2013,
The Grundy number of a graph G , denoted by Γ ( G ), is the largest k such that...
The Parameterized Complexity of Unique Coverage and Its Variants
The Parameterized Complexity of Unique Coverage and Its Variants
2013,
In this paper we study the parameterized complexity of the Unique Coverage problem, a...
Parameterized Two-Player Nash Equilibrium
Parameterized Two-Player Nash Equilibrium
2013,
We study the problem of computing Nash equilibria in a two‐player normal form...
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
2013,
We consider two natural generalizations of the Asymmetric Traveling Salesman problem:...
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy
2013,
This paper is concerned with online scheduling algorithms that aim at minimizing the...
On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems
On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems
2013,
Given a graph G =( V , E ) and a positive integer k , an edge modification problem for...
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
2013,
Given a graph with n vertices, k terminals and positive integer weights not larger...
Proper Interval Vertex Deletion
Proper Interval Vertex Deletion
2013,
The NP‐complete problem Proper Interval Vertex Deletion is to decide whether an...
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
2013,
The coverability and boundedness problems for Petri nets are known to be Expspace...
Tile Complexity of Approximate Squares
Tile Complexity of Approximate Squares
2013,
The standard Tile Assembly Model (TAM) of Winfree (Algorithmic self‐assembly of...
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
2013,
Let G =( V , E ) be an undirected unweighted graph. A path between any two vertices u...
Maximum Matching in Regular and Almost Regular Graphs
Maximum Matching in Regular and Almost Regular Graphs
2013,
We present an O ( n 2 log n )‐time algorithm that finds a maximum matching in a...
Isotonic Regression via Partitioning
Isotonic Regression via Partitioning
2013,
Algorithms are given for determining weighted isotonic regressions satisfying order...
Fast Maximal Cliques Enumeration in Sparse Graphs
Fast Maximal Cliques Enumeration in Sparse Graphs
2013,
In this paper, we consider the problem of generating all maximal cliques in a sparse...
Papers per page: