PORTA - MaRDI portal

Cited in

(only showing first 100 items - show all)

cdd
Normaliz
An approval-voting polytope for linear orders
TSPLIB
INGRID
Canonical modules of certain edge subrings
Facets of linear signed order polytopes.
Weak order polytopes.
Some facets of the polytope of even permutation matrices.
RAMP
ABACUS
Quasi-semi-metrics, oriented multi-cuts and related polyhedra
Formulating logical implications in combinatorial optimisation
Geomview
CARAT
cddplus
Complete formulations of polytopes related to extensions of assignment matrices
azove
lrs
Concorde
barvinok
OPBDP
Limited memory rank-1 cuts for vehicle routing problems
Extended formulations for order polytopes through network flows
A two-level graph partitioning problem arising in mobile wireless communications
The hypermetric cone and polytope on eight vertices and some generalizations
Multi-commodity variable upper bound flow models
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
Integer programming approach to static monopolies in graphs
Identification of unidentified equality constraints for integer programming problems
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
Interior point methods in DEA to determine non-zero multiplier weights
The biorder polytope
Projections of polytopes and the generalized Baues conjecture
KARDOS
On the combinatorial structure of the approval-voting polytope
Branch and cut algorithms for detecting critical nodes in undirected graphs
The representation polyhedron of a semiorder.
Generating partitions of a graph into a fixed number of minimum weight cuts
On a generalization of the master cyclic group polyhedron
Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals
MOPS
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
A duality theorem for the ic-resurgence of edge ideals
The 2D subarray polytope
SymPol
PolyLib
Facets from gadgets
Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
On a recognition problem on cut polytope relaxations
bc-prod
A branch-and-cut algorithm for the target visitation problem
On cutting planes for cardinality-constrained linear programs
Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
On the facial structure of symmetric and graphical traveling salesman polyhedra
On the separation of split inequalities for non-convex quadratic integer programming
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
Computing convex hulls and counting integer points with \texttt{polymake}
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Facets for the single node fixed-charge network set with a node set-up variable
SMAPO
PANDA
LOLIB
Computing finest mincut partitions of a graph and application to routing problems
Series-parallel graphs are windy postman perfect
Formulations and valid inequalities for the heterogeneous vehicle routing problem
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
HUHFA
The 2-edge-connected subgraph polyhedron
Algorithm 769
Mixed integer models for the stationary case of gas network optimization
A survey on the linear ordering problem for weighted or unweighted tournaments
infinite group relaxation
Lifting the knapsack cover inequalities for the knapsack polytope
A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
qskeleton
Polyhedral aspects of partial orders and comparability graphs
Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
Exploiting symmetries in polyhedral computations
StateTrace
Single-commodity robust network design with finite and hose demand sets
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
Bayes factors for state-trace analysis
ITIP
The polytope of m-subspaces of a finite affine space
Complexity and algorithms for computing Voronoi cells of lattices
Finding the exact integrality gap for small traveling salesman problems
Gear composition of stable set polytopes and G-perfection
Projecting an extended formulation for mixed-integer covers on bipartite graphs
BIEMS
mplrs
Radial Level Planarity Testing and Embedding in Linear Time
On the facets and diameter of thek-cycle polytope
Classification of eight-dimensional perfect forms
pd
Polyhedral
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships

This page was built for software: PORTA