Journal: Discrete Optimization

Found 150 papers in total
Edge criticality in secure graph domination
Edge criticality in secure graph domination
2015,
A subset X of the vertex set of a graph G is a secure dominating set of G if X is a...
Arc-based integer programming formulations for three variants of proportional symbol maps
Arc-based integer programming formulations for three variants of proportional symbol maps
2015,
A new formulation is described to create optimal proportional symbol maps. We address...
Time-dependent optimization of a multi-item uncertain supply chain network: A hybrid approximation algorithm
Time-dependent optimization of a multi-item uncertain supply chain network: A hybrid approximation algorithm
2015,
We consider the uncertain least cost shipping problem. The input is a...
A branch-and-price-and-cut method for computing an optimal bramble
A branch-and-price-and-cut method for computing an optimal bramble
2015,
Given an undirected graph, a bramble is a set of connected subgraphs (called bramble...
Shortest path algorithms for functional environments
Shortest path algorithms for functional environments
2015,
This research generalises classic shortest path algorithms to network environments in...
The multi-band robust knapsack problem–A dynamic programming approach
The multi-band robust knapsack problem–A dynamic programming approach
2015,
In this paper, we consider the multi‐band robust knapsack problem which...
Intersection cuts–standard versus restricted
Intersection cuts–standard versus restricted
2015,
This note is meant to elucidate the difference between intersection cuts as originally...
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
2015,
The quadratic matching problem (QMP) asks for a matching in a graph that optimises a...
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
2015,
In this paper, we develop a theory of new classes of discrete convex functions, called...
Geometric versions of the three-dimensional assignment problem under general norms
Geometric versions of the three-dimensional assignment problem under general norms
2015,
We discuss the computational complexity of special cases of the...
Supermodular covering knapsack polytope
Supermodular covering knapsack polytope
2015,
The supermodular covering knapsack set is the discrete upper level set of a...
Metric inequalities for routings on direct connections with application to line planning
Metric inequalities for routings on direct connections with application to line planning
2015,
We consider multi‐commodity flow problems in which capacities are installed on...
The dominance assignment problem
The dominance assignment problem
2012,
We prove the following remarkable fact for matrices with entries from an ordered set:...
Lattice‐based algorithms for number partitioning in the hard phase
Lattice‐based algorithms for number partitioning in the hard phase
2012,
We propose reductions of the NPP and the BalNPP in the hard phase to the closest...
Exact interdiction models and algorithms for disconnecting networks via node deletions
Exact interdiction models and algorithms for disconnecting networks via node deletions
2012,
This paper analyzes the problem of maximizing the disconnectivity of undirected graphs...
Exact solution of the 2‐dimensional grid arrangement problem
Exact solution of the 2‐dimensional grid arrangement problem
2012,
Given an undirected graph G = ( V , E ) , we consider injective mappings of its...
On finitely generated closures in the theory of cutting planes
On finitely generated closures in the theory of cutting planes
2012,
Let P be a rational polyhedron in ‐ R d and let L be a class of d...
Mixed n‐step MIR inequalities: Facets for the n‐mixing set
Mixed n‐step MIR inequalities: Facets for the n‐mixing set
2012,
Günlük and Pochet [O. Günlük, Y. Pochet, Mixing mixed integer...
Total domination and the Caccetta–Häggkvist conjecture
Total domination and the Caccetta–Häggkvist conjecture
2012,
A total dominating set in a digraph G is a subset W of its vertices such that every...
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
2012,
In the majority of works on online scheduling on multipurpose machines the objective...
On the computability of equitable divisions
On the computability of equitable divisions
2012,
Let the cake be represented by the unit interval of reals, with players having private...
The (K,k) ‐capacitated spanning tree problem
The (K,k) ‐capacitated spanning tree problem
2012,
This paper considers a generalization of the capacitated spanning tree problem, in...
The best choice problem for upward directed graphs
The best choice problem for upward directed graphs
2012,
We consider a generalization of the best choice problem to upward directed graphs. We...
2‐balanced flows and the inverse 1‐median problem in the Chebyshev space
2‐balanced flows and the inverse 1‐median problem in the Chebyshev space
2012,
In this paper, we consider the 1‐median problem in ‐ R d with the...
Papers per page: