Keyword: graphs

Found 1175 papers in total
New results about impartial solitaire clobber
New results about impartial solitaire clobber
2009,
Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber,...
A graph theory approach for designing conservation reserve networks with minimal fragmentation
A graph theory approach for designing conservation reserve networks with minimal fragmentation
2008,
Habitat fragmentation is often cited as one of the most important factors that...
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
2009,
The smallest k-ECSS problem is, given a graph along with an integer k , find a...
On a binary-encoded ILP coloring formulation
On a binary-encoded ILP coloring formulation
2007,
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors...
Acyclic orientations with path constraints
Acyclic orientations with path constraints
2008,
Many well–known combinatorial optimization problems can be stated over the set...
An exact mathematical programming approach to multiple RNA sequence-structure alignment
An exact mathematical programming approach to multiple RNA sequence-structure alignment
2008,
One of the main tasks in computational biology is the computation of alignments of...
Chain partitioning as a key element for building vehicle routing problem heuristics
Chain partitioning as a key element for building vehicle routing problem heuristics
2008,
Chain partitioning is the process of partitioning a tree into chains. The edges and...
Exact algorithms for a loading problem with bounded clique width
Exact algorithms for a loading problem with bounded clique width
2006,
In this paper we discuss a special pallet–loading problem, which we encountered...
Simple and fast surrogate constraint heuristics for the maximum independent set problem
Simple and fast surrogate constraint heuristics for the maximum independent set problem
2008,
In a recent paper Glover (2003) discussed a variety of surrogate...
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Exploiting planarity in separation routines for the symmetric traveling salesman problem
2008,
At present, the most successful approach for solving large-scale instances of the...
A three-phase algorithm for the cell suppression problem in two-dimensional statistical tables
A three-phase algorithm for the cell suppression problem in two-dimensional statistical tables
2008,
To obtain full cooperation from respondents, statistical offices must guarantee that...
On the p-median polytope of Y-free graphs
On the p-median polytope of Y-free graphs
2008,
In this paper we consider a well-known class of valid inequalities for the p -median...
The inverse 1-median problem on a cycle
The inverse 1-median problem on a cycle
2008,
Let the graph G=(V,E) be a cycle with n +1 vertices, non-negative vertex weights...
Multiperiod hypergraph models for water systems optimization
Multiperiod hypergraph models for water systems optimization
2008,
Mathematical models describing water resources systems optimization are characterized...
Average tree solution and subcore for acyclic graph games
Average tree solution and subcore for acyclic graph games
2008,
In this paper we consider cooperative transferable utility games with limited...
Memetic algorithms: the polynomial local search complexity theory perspective
Memetic algorithms: the polynomial local search complexity theory perspective
2008,
In previous work we developed a syntax-only classification of evolutionary algorithms,...
On the Kth best base of a matroid
On the Kth best base of a matroid
2008,
Given a weighted matroid M and a positive integer K , the K th best base of M problem...
An improved MST algorithm for ranking players of a round-robin tournament
An improved MST algorithm for ranking players of a round-robin tournament
2008,
The problem of ranking players in a round-robin tournament, in which the outcome of...
The hypercube model: analysis and results for the case of homogeneous non-servers
The hypercube model: analysis and results for the case of homogeneous non-servers
2001,
The objective of the present paper is to analyze the use and solution of the hypercube...
Decision process in a water use conflict in Brazil
Decision process in a water use conflict in Brazil
2008,
This paper presents a procedure for decision analysis in water use conflicts among...
The prize-collecting generalized minimum spanning tree problem
The prize-collecting generalized minimum spanning tree problem
2008,
We introduce the prize-collecting generalized minimum spanning tree problem. In this...
Algorithms for the problem of non-capacitated flows with fixed costs in arcs: a statistical comparison
Algorithms for the problem of non-capacitated flows with fixed costs in arcs: a statistical comparison
2001,
This paper is concerned about empirical comparisons of algorithms, one of the most...
Optimized versions of a distributed algorithm for solving path problems
Optimized versions of a distributed algorithm for solving path problems
2000,
Path problems are a family of optimization and enumeration problems that reduce to...
The shortest multipaths problem in a capacitated dense channel
The shortest multipaths problem in a capacitated dense channel
2007,
In this paper, we present a simple polynomial-time algorithm solving the shortest...
Papers per page: