swMATH4869MaRDI QIDQ17024FDOQ17024
Author name not available (Why is that?)
Official website: https://wwwproxy.iwr.uni-heidelberg.de/groups/comopt/software/PORTA/
Cited In (only showing first 100 items - show all)
- Lifting the knapsack cover inequalities for the knapsack polytope
- Title not available (Why is that?)
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Extended formulations for order polytopes through network flows
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- Convex relaxations for mixed-integer nonlinear programs
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- Facets of linear signed order polytopes.
- Monomial subrings in arbitrary dimension
- A computer-assisted proof of Saari’s conjecture for the planar three-body problem
- Title not available (Why is that?)
- Polyhedral aspects of partial orders and comparability graphs
- Multi-commodity variable upper bound flow models
- A two-level graph partitioning problem arising in mobile wireless communications
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Interior point methods in DEA to determine non-zero multiplier weights
- Primary facets of order polytopes
- Vertex adjacencies in the set covering polyhedron
- Individual differences in the algebraic structure of preferences
- Classification of eight-dimensional perfect forms
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- Limited memory rank-1 cuts for vehicle routing problems
- Strong and compact relaxations in the original space using a compact extended formulation
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- Small bipartite subgraph polytopes
- Complete formulations of polytopes related to extensions of assignment matrices
- Title not available (Why is that?)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- An approval-voting polytope for linear orders
- The stable set polytope of icosahedral graphs
- Polyhedral representation conversion up to symmetries
- Weak order polytopes.
- On the facets and diameter of thek-cycle polytope
- Title not available (Why is that?)
- The biorder polytope
- The representation polyhedron of a semiorder.
- On the separation of split inequalities for non-convex quadratic integer programming
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- Projecting an extended formulation for mixed-integer covers on bipartite graphs
- On cutting planes for cardinality-constrained linear programs
- Identification of unidentified equality constraints for integer programming problems
- Projections of polytopes and the generalized Baues conjecture
- Canonical modules of certain edge subrings
- Title not available (Why is that?)
- The hypermetric cone and polytope on eight vertices and some generalizations
- Optimizing over the First Chvàtal Closure
- On the combinatorial structure of the approval-voting polytope
- The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
- Exploiting symmetries in polyhedral computations
- Detecting critical node structures on graphs: a mathematical programming approach
- A duality theorem for the ic-resurgence of edge ideals
- Facets from gadgets
- Exact solution of the evasive flow capturing problem
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
- addibit
- Nonlocality in sequential correlation scenarios
- One-adhesive polymatroids.
- On a recognition problem on cut polytope relaxations
- The polytope of \(m\)-subspaces of a finite affine space
- Accelerating Fourier-Motzkin elimination using bit pattern trees
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
- A branch-and-cut algorithm for the target visitation problem
- Classical logic, classical probability, and quantum mechanics
- 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
- Series-parallel graphs are windy postman perfect
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
- The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
- The 2D subarray polytope
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
- On the separation of disjunctive cuts
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- The 2-edge-connected subgraph polyhedron
- On the polyhedral structure of uniform cut polytopes
- Title not available (Why is that?)
- Some facets of the polytope of even permutation matrices.
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Single-commodity robust network design with finite and hose demand sets
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Bayes factors for state-trace analysis
- Finiteness of stationary configurations of the four-vortex problem
- Gear composition of stable set polytopes and \(\mathcal G\)-perfection
- Causal structures from entropic information: geometry and novel scenarios
- Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- 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
- Finding the exact integrality gap for small traveling salesman problems
- Intermediate integer programming representations using value disjunctions
This page was built for software: PORTA
