Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2009
In recent years, branch-and-cut algorithms have become firmly established as the most effective method for solving generic mixed integer linear programs (MIPs). Methods for automatically generating inequalities valid for the convex hull of solutions to such MIPs are a critical element of branch-and-cut. This paper examines the nature of the so-called separation problem, which is that of generating a valid inequality violated by a given real vector, usually arising as the solution to a relaxation of the original problem.
Cologne Twente Workshop on Graphs and Combinatorical Optimization
Two Upper Bounds on the Chromatic Number2009 •
Cologne Twente Workshop on Graphs and Combinatorical Optimization
Colored Resource Allocation Games2009 •
Cologne Twente Workshop on Graphs and Combinatorical Optimization
Colored Trees in Edge-Colored Graphs2009 •
Proc. of Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Minimum sum set coloring on some subclasses of block graphs2009 •
In this work we study the Minimum Sum Set Coloring Problem (MSSCP) which consists in assign a set of ω (v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. This problem generalizes the well known Minimum Sum Coloring Problem, which is solvable in polynomial time on block graphs. We study two versions of the MSSCP (preemptive and non-preemptive) on two subclasses of ...
Computers & Operations Research
The open capacitated arc routing problem2011 •
Cologne Twente Workshop on Graphs and Combinatorical Optimization
On the Complexity of Graph-Based Bounds for the Probability Bounding Problem2009 •
Lecture Notes in Computer Science
Finding Lower Bounds for Nondeterministic State Complexity Is Hard2006 •
Emerging Challenges for …
A probabilistic bound on the basic role mining problem and its applications2009 •
Lecture Notes in Computer Science
Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP2007 •
Discrete Applied Mathematics
On the locating chromatic number of Kneser graphs2011 •
Information Processing Letters
An exact exponential time algorithm for counting bipartite cliques2012 •
Discrete Applied Mathematics
Bounds for visual cryptography schemes2010 •
Graphs and Combinatorics
Dominated Colorings of Graphs2014 •
Lecture Notes in Computer Science
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs2010 •
Electronic Notes in Discrete Mathematics
A New Neighborhood for the QAP2008 •
2014 •
Computing Research Repository
The Complexity of Surjective Homomorphism Problems -- a Survey2011 •
Discrete Applied Mathematics
On edge-sets of bicliques in graphs2012 •
Journal of Discrete Algorithms
Hamiltonian orthogeodesic alternating paths2012 •
Journal of Discrete Algorithms
Acyclic colorings of graph subdivisions revisited2012 •
2012 •
2018 •
Journal of Physics: Conference Series
Parallel algorithms for finding cliques in a graph2011 •
SIAM Journal on Discrete Mathematics
Coloring the Maximal Cliques of Graphs2004 •
Journal of Graph Algorithms and Applications
A Split & Push Approach to 3D Orthogonal Drawing2000 •