Journal: Journal of Combinatorial Optimization

Found 352 papers in total
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
2011,
In this paper, we first present a binary linear programming formulation for the...
Fast searching games on graphs
Fast searching games on graphs
2011,
Given a graph, suppose that intruders hide on vertices or along edges of the graph....
The multiple sequence sets: problem and heuristic algorithms
The multiple sequence sets: problem and heuristic algorithms
2011,
‘Sequence set’ is a mathematical model used in many applications such as...
Minimizing makespan in an ordered flow shop with machine‐dependent processing times
Minimizing makespan in an ordered flow shop with machine‐dependent processing times
2011,
We consider a generalization of the proportionate flow shop problem with the makespan...
Which trees have a differentiating‐paired dominating set?
Which trees have a differentiating‐paired dominating set?
2011,
In this paper, we continue the study of paired-domination in graphs introduced by...
A special combinatorial problem: pitch arrangement for pneumatic tires
A special combinatorial problem: pitch arrangement for pneumatic tires
2011,
In this paper, we introduce a combinatorial problem faced in the tire industry and...
Robust multi‐sensor scheduling for multi‐site surveillance
Robust multi‐sensor scheduling for multi‐site surveillance
2011,
This paper presents mathematical programming techniques for solving a class of...
Line facility location in weighted regions
Line facility location in weighted regions
2011,
In this paper, we present approximation algorithms for solving the line facility...
On the Bandpass problem
On the Bandpass problem
2011,
The complexity of the Bandpass problem is re‐investigated. Specifically, we...
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
2011,
Given a simple, undirected graph G =( V , E ) and a weight function w : E →ℤ...
Anonymizing binary and small tables is hard to approximate
Anonymizing binary and small tables is hard to approximate
2011,
The problem of publishing personal data without giving up privacy is becoming...
A characterization of graphs with disjoint dominating and paired‐dominating sets
A characterization of graphs with disjoint dominating and paired‐dominating sets
2011,
A dominating set of a graph is a set of vertices such that every vertex not in the set...
Upper paired‐domination in claw‐free graphs
Upper paired‐domination in claw‐free graphs
2011,
A set S of vertices in a graph G is a paired‐dominating set of G if every...
The flexible blocking job shop with transfer and set‐up times
The flexible blocking job shop with transfer and set‐up times
2011,
The Flexible Blocking Job Shop (FBJS) considered here is a job shop scheduling problem...
Pooling designs for clone library screening in the inhibitor complex model
Pooling designs for clone library screening in the inhibitor complex model
2011,
In this paper we introduce inhibitors into the complex model and we give a lower bound...
An optimal semi‐online algorithm for 2‐machine scheduling with an availability constraint
An optimal semi‐online algorithm for 2‐machine scheduling with an availability constraint
2011,
This paper considers a problem of semi‐online scheduling jobs on two identical...
Restrained domination in cubic graphs
Restrained domination in cubic graphs
2011,
Let G =( V , E ) be a graph. A set S ⊆ V is a restrained dominating set if every...
A parallel multi‐population genetic algorithm for a constrained two‐dimensional orthogonal packing problem
A parallel multi‐population genetic algorithm for a constrained two‐dimensional orthogonal packing problem
2011,
This paper addresses a constrained two‐dimensional (2D), non‐guillotine...
Optimal wafer cutting in shuttle layout problems
Optimal wafer cutting in shuttle layout problems
2011,
A major cost in semiconductor manufacturing is the generation of photo masks which are...
Sharp bounds for Zagreb indices of maximal outerplanar graphs
Sharp bounds for Zagreb indices of maximal outerplanar graphs
2011,
For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of...
Reconstruction of hidden graphs and threshold group testing
Reconstruction of hidden graphs and threshold group testing
2011,
Classical group testing is a search paradigm where the goal is the identification of...
On the power domination number of the generalized Petersen graphs
On the power domination number of the generalized Petersen graphs
2011,
The problem of monitoring an electric power system by placing as few measurement...
Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
2011,
Let 𝒞 be a uniform clutter and let A be the incidence matrix of 𝒞. We denote...
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: