297 research outputs found
Software for cut-generating functions in the Gomory--Johnson model and beyond
We present software for investigations with cut generating functions in the
Gomory-Johnson model and extensions, implemented in the computer algebra system
SageMath.Comment: 8 pages, 3 figures; to appear in Proc. International Congress on
Mathematical Software 201
Structure and Interpretation of Dual-Feasible Functions
We study two techniques to obtain new families of classical and general
Dual-Feasible Functions: A conversion from minimal Gomory--Johnson functions;
and computer-based search using polyhedral computation and an automatic
maximality and extremality test.Comment: 6 pages extended abstract to appear in Proc. LAGOS 2017, with 21
pages of appendi
New computer-based search strategies for extreme functions of the Gomory--Johnson infinite group problem
We describe new computer-based search strategies for extreme functions for
the Gomory--Johnson infinite group problem. They lead to the discovery of new
extreme functions, whose existence settles several open questions.Comment: 54 pages, many figure
On Minimal Valid Inequalities for Mixed Integer Conic Programs
We study disjunctive conic sets involving a general regular (closed, convex,
full dimensional, and pointed) cone K such as the nonnegative orthant, the
Lorentz cone or the positive semidefinite cone. In a unified framework, we
introduce K-minimal inequalities and show that under mild assumptions, these
inequalities together with the trivial cone-implied inequalities are sufficient
to describe the convex hull. We study the properties of K-minimal inequalities
by establishing algebraic necessary conditions for an inequality to be
K-minimal. This characterization leads to a broader algebraically defined class
of K- sublinear inequalities. We establish a close connection between
K-sublinear inequalities and the support functions of sets with a particular
structure. This connection results in practical ways of showing that a given
inequality is K-sublinear and K-minimal.
Our framework generalizes some of the results from the mixed integer linear
case. It is well known that the minimal inequalities for mixed integer linear
programs are generated by sublinear (positively homogeneous, subadditive and
convex) functions that are also piecewise linear. This result is easily
recovered by our analysis. Whenever possible we highlight the connections to
the existing literature. However, our study unveils that such a cut generating
function view treating the data associated with each individual variable
independently is not possible in the case of general cones other than
nonnegative orthant, even when the cone involved is the Lorentz cone
JGraphT -- A Java library for graph data structures and algorithms
Mathematical software and graph-theoretical algorithmic packages to
efficiently model, analyze and query graphs are crucial in an era where
large-scale spatial, societal and economic network data are abundantly
available. One such package is JGraphT, a programming library which contains
very efficient and generic graph data-structures along with a large collection
of state-of-the-art algorithms. The library is written in Java with stability,
interoperability and performance in mind. A distinctive feature of this library
is the ability to model vertices and edges as arbitrary objects, thereby
permitting natural representations of many common networks including
transportation, social and biological networks. Besides classic graph
algorithms such as shortest-paths and spanning-tree algorithms, the library
contains numerous advanced algorithms: graph and subgraph isomorphism; matching
and flow problems; approximation algorithms for NP-hard problems such as
independent set and TSP; and several more exotic algorithms such as Berge graph
detection. Due to its versatility and generic design, JGraphT is currently used
in large-scale commercial, non-commercial and academic research projects. In
this work we describe in detail the design and underlying structure of the
library, and discuss its most important features and algorithms. A
computational study is conducted to evaluate the performance of JGraphT versus
a number of similar libraries. Experiments on a large number of graphs over a
variety of popular algorithms show that JGraphT is highly competitive with
other established libraries such as NetworkX or the BGL.Comment: Major Revisio
The Traveling Salesman Problem: Deceptivley Easy to State; Notoriously Hard to Solve
The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem and to show how it has been an integral part of the development of the fields of Integer Programming, and Combinatorial Optimization. The thesis starts in the 1800s and progresses through current attempts on solutions of the problem. The thesis is not meant to describe in detail every attempt made, nor to describe an original solution, but to provide a high level overview of every solution attempt, and to guide the reader on what has been done, and what still can be done
- …