Cited in
(only showing first 100 items - show all)- Facets for the single node fixed-charge network set with a node set-up variable
- The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- Exploiting symmetries in polyhedral computations
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Lifting the knapsack cover inequalities for the knapsack polytope
- Detecting critical node structures on graphs: a mathematical programming approach
- On the separation of disjunctive cuts
- scientific article; zbMATH DE number 2086917 (Why is no real title available?)
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- A duality theorem for the ic-resurgence of edge ideals
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Facets from gadgets
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- On the polyhedral structure of uniform cut polytopes
- Extended formulations for order polytopes through network flows
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- The 2-edge-connected subgraph polyhedron
- Exact solution of the evasive flow capturing problem
- Some facets of the polytope of even permutation matrices.
- scientific article; zbMATH DE number 1178278 (Why is no real title available?)
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- Convex relaxations for mixed-integer nonlinear programs
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Facets of linear signed order polytopes.
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Monomial subrings in arbitrary dimension
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- A computer-assisted proof of Saari’s conjecture for the planar three-body problem
- Polyhedral aspects of partial orders and comparability graphs
- Single-commodity robust network design with finite and hose demand sets
- Multi-commodity variable upper bound flow models
- A two-level graph partitioning problem arising in mobile wireless communications
- scientific article; zbMATH DE number 5021774 (Why is no real title available?)
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Bayes factors for state-trace analysis
- A tutorial on branch and cut algorithms for the maximum stable set problem
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Finiteness of stationary configurations of the four-vortex problem
- Interior point methods in DEA to determine non-zero multiplier weights
- Gear composition of stable set polytopes and \(\mathcal G\)-perfection
- Primary facets of order polytopes
- Vertex adjacencies in the set covering polyhedron
- Causal structures from entropic information: geometry and novel scenarios
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Individual differences in the algebraic structure of preferences
- Finding the exact integrality gap for small traveling salesman problems
- Intermediate integer programming representations using value disjunctions
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- MIP reformulations of the probabilistic set covering problem
- Nonlocality in sequential correlation scenarios
- Finiteness of relative equilibria of the four-body problem
- Computing convex hulls and counting integer points with \texttt{polymake}
- Classification of eight-dimensional perfect forms
- Optimizing over the first Chvátal closure
- On a recognition problem on cut polytope relaxations
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- One-adhesive polymatroids.
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra
- Formulating logical implications in combinatorial optimisation
- Computational geometry of positive definite quadratic forms. Polyhedral reduction theories, algorithms, and applications
- On packing and covering polyhedra of consecutive ones circulant clutters
- Strong and compact relaxations in the original space using a compact extended formulation
- Limited memory rank-1 cuts for vehicle routing problems
- Small bipartite subgraph polytopes
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- cdd
- Normaliz
- INGRID
- TSPLIB
- RAMP
- ABACUS
- Geomview
- CARAT
- cddplus
- azove
- Concorde
- lrs
- barvinok
- OPBDP
- KARDOS
- PANDA
- MOPS
- PolyLib
- SymPol
- bc-prod
- LOLIB
- SMAPO
- Algorithm 769
- HUHFA
This page was built for software: PORTA
