Journal: Discrete Optimization

Found 150 papers in total
FPT algorithms for path‐transversal and cycle‐transversal problems
FPT algorithms for path‐transversal and cycle‐transversal problems
2011,
We study the parameterized complexity of several vertex‐ and...
The parameterized complexity of k‐flip local search for SAT and MAX SAT
The parameterized complexity of k‐flip local search for SAT and MAX SAT
2011,
SAT and MAX SAT are among the most prominent problems for which local search...
Stable assignment with couples: Parameterized complexity and local search
Stable assignment with couples: Parameterized complexity and local search
2011,
We study the Hospitals/Residents with Couples problem, a variant of the classical...
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Parameterized complexity and approximability of the Longest Compatible Sequence problem
2011,
We introduce the Longest Compatible Sequence ( Slcs ) problem. This problem deals with...
On the directed Full Degree Spanning Tree problem
On the directed Full Degree Spanning Tree problem
2011,
We study the parameterized complexity of a directed analog of the Full Degree Spanning...
Graph‐based data clustering with overlaps
Graph‐based data clustering with overlaps
2011,
We introduce overlap cluster graph modification problems where, other than in most...
Treewidth governs the complexity of target set selection
Treewidth governs the complexity of target set selection
2011,
In this paper we study the Target Set Selection problem proposed by Kempe, Kleinberg,...
Charge and reduce: A fixed‐parameter algorithm for String‐to‐String Correction
Charge and reduce: A fixed‐parameter algorithm for String‐to‐String Correction
2011,
String distance problems typically ask for a minimum number of permitted operations to...
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...
How tight is the corner relaxation?
How tight is the corner relaxation?
2008,
Given a mixed-integer linear programming (MILP) model and an optimal basis of the...
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
2008,
Extending our work on second-order cover cuts, we introduce a new class of...
Intermediate integer programming representations using value disjunctions
Intermediate integer programming representations using value disjunctions
2008,
We introduce a general technique for creating an extended formulation of a...
Nonconvex, lower semicontinuous piecewise linear optimization
Nonconvex, lower semicontinuous piecewise linear optimization
2008,
A branch-and-cut algorithm for solving linear problems with continuous separable...
Note on pseudolattices, lattices and submodular linear programs
Note on pseudolattices, lattices and submodular linear programs
2008,
A pseudolattice L is a poset with lattice-type binary operations. Given a submodular...
Stochastic scheduling in an in-forest
Stochastic scheduling in an in-forest
2008,
Consider a problem of scheduling activities of a research and development project,...
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
2008,
The ‘roof dual’ of a QUBO (Quadratic Unconstrained Binary Optimization)...
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...
The travelling preacher, projection, and a lower bound for the stability number of a graph
The travelling preacher, projection, and a lower bound for the stability number of a graph
2008,
The coflow min–max equality is given a travelling preacher interpretation, and...
Polarity and the complexity of the shooting experiment
Polarity and the complexity of the shooting experiment
2008,
We exhibit a polar relationship between two measures that have been proposed to...
Computing robust base stock levels
Computing robust base stock levels
2008,
This paper considers how to optimally set the basestock level for a single buffer when...
George B. Dantzig and systems optimization
George B. Dantzig and systems optimization
2008,
We pay homage to George B. Dantzig by describing a less well-known part of his legacy...
Combined route capacity and route length models for unit demand vehicle routing problems
Combined route capacity and route length models for unit demand vehicle routing problems
2008,
We consider two types of hop-indexed models for the unit-demand asymmetric Capacitated...
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
2008,
We generalize the standard vehicle routing problem with time windows by allowing both...
Papers per page: