Keyword: combinatorial optimization

Found 3184 papers in total
Triple-solution approach for the strip packing problem with two-staged patterns
Triple-solution approach for the strip packing problem with two-staged patterns
2017,
A triple‐solution approach for the rectangular level strip packing problem is...
Recoverable robust spanning tree problem under interval uncertainty representations
Recoverable robust spanning tree problem under interval uncertainty representations
2017,
This paper deals with the recoverable robust spanning tree problem under interval...
Total edge irregularity strength of accordion graphs
Total edge irregularity strength of accordion graphs
2017,
An edge irregular total k ‐labeling φ : V ∪ E → { 1 , 2 , …...
Distance domination in graphs with given minimum and maximum degree
Distance domination in graphs with given minimum and maximum degree
2017,
For an integer k ≥ 1 , a distance k ‐dominating set of a connected graph G...
On maximum Wiener index of trees and graphs with given radius
On maximum Wiener index of trees and graphs with given radius
2017,
Let G be a connected graph of order n . The long‐standing open and close...
A note on orientation and chromatic number of graphs
A note on orientation and chromatic number of graphs
2017,
Let D be any edge orientation of a graph G . We denote by Δ k ( D ) the maximum...
Independent sets in some classes of Si,j,k-free graphs
Independent sets in some classes of Si,j,k-free graphs
2017,
The maximum weight independent set (MWIS) problem on graphs with vertex weights asks...
Task assignment in tree-like hierarchical structures
Task assignment in tree-like hierarchical structures
2017,
Many large organizations, such as corporations, are hierarchical by nature. In...
Matching and domination numbers in r-uniform hypergraphs
Matching and domination numbers in r-uniform hypergraphs
2017,
A matching is a set of pairwise disjoint hyperedges of a hypergraph H . The matching...
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
2017,
In this paper, we consider the single‐machine scheduling problem with...
The Weight Function Lemma for graph pebbling
The Weight Function Lemma for graph pebbling
2017,
Graph pebbling is a network model for studying whether or not a given supply of...
Two-agent scheduling of time-dependent jobs
Two-agent scheduling of time-dependent jobs
2017,
We consider the problem of scheduling deteriorating jobs or shortening jobs with two...
The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
2017,
A (proper) total‐ k ‐coloring of a graph G is a mapping ϕ : V ( G )...
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
2017,
Let G = ( V , E ) be a graph. For two vertices u and v in G , we denote d G ( u , v )...
Equitable vertex arboricity of 5-degenerate graphs
Equitable vertex arboricity of 5-degenerate graphs
2017,
Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of...
Fibonacci helps to evacuate from a convex region in a grid network
Fibonacci helps to evacuate from a convex region in a grid network
2017,
This study considers an evacuation problem where the evacuees try to escape to the...
On the vertex cover P3 problem parameterized by treewidth
On the vertex cover P3 problem parameterized by treewidth
2017,
Consider a graph G . A subset of vertices, F , is called a vertex cover P t ( V C P t...
A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning
A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning
2017,
Hybrid manufacturing and remanufacturing systems have become a topic of considerable...
Parallel machine scheduling with general sum of processing time based models
Parallel machine scheduling with general sum of processing time based models
2017,
In this paper, we analyse the parallel machine makespan minimization problem with the...
A new fully polynomial time approximation scheme for the interval subset sum problem
A new fully polynomial time approximation scheme for the interval subset sum problem
2017,
The interval subset sum problem (ISSP) is a generalization of the well‐known...
Non-preemptive buffer management for latency sensitive packets
Non-preemptive buffer management for latency sensitive packets
2017,
The delivery of latency sensitive packets is a crucial issue in real‐time...
An exact algorithm for parallel machine scheduling with conflicts
An exact algorithm for parallel machine scheduling with conflicts
2017,
We consider an extension of classic parallel machine scheduling where a set of jobs is...
An exact extended formulation for the unrelated parallel machine total weighted completion time problem
An exact extended formulation for the unrelated parallel machine total weighted completion time problem
2017,
The plethora of research on NP ‐hard parallel machine scheduling problems is...
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
2017,
We consider the scheduling problem in which two agents (agents A and B ), each having...
Papers per page: