PORTA

swMATH4869MaRDI QIDQ17024FDOQ17024

Author name not available (Why is that?)

Described by source

• Combinatorial optimization and small polytopes

Cited In (only showing first 100 items - show all)

• 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
• Lifting the knapsack cover inequalities for the knapsack polytope
• Title not available (Why is that?)
• Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
• 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
• Title not available (Why is that?)
• 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?)
• Convex relaxations for mixed-integer nonlinear programs
• 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
• A computer-assisted proof of Saari’s conjecture for the planar three-body problem
• Polyhedral aspects of partial orders and comparability graphs
• 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
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• Bayes factors for state-trace analysis
• Finiteness of stationary configurations of the four-vortex problem
• Causal structures from entropic information: geometry and novel scenarios
• Primary facets of order polytopes
• Vertex adjacencies in the set covering polyhedron
• 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
• Mirror symmetry and projective geometry of Reye congruences I
• Individual differences in the algebraic structure of preferences
• 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
• Classification of eight-dimensional perfect forms
• Computing convex hulls and counting integer points with \texttt{polymake}
• Finiteness of relative equilibria of the four-body problem
• Optimizing over the first Chvátal closure
• Quasi-semi-metrics, oriented multi-cuts and related polyhedra
• Formulating logical implications in combinatorial optimisation
• On packing and covering polyhedra of consecutive ones circulant clutters
• Strong and compact relaxations in the original space using a compact extended formulation
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Small bipartite subgraph polytopes
• Computing finest mincut partitions of a graph and application to routing problems
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Title not available (Why is that?)
• On a generalization of the master cyclic group polyhedron
• An approval-voting polytope for linear orders
• Polyhedral representation conversion up to symmetries
• Weak order polytopes.
• Polymake: an approach to modular software design in computational geometry
• Mixed integer models for the stationary case of gas network optimization
• On the facets and diameter of thek-cycle polytope
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The biorder polytope
• Radial Level Planarity Testing and Embedding in Linear Time
• Gear Composition of Stable Set Polytopes and 𝒢-Perfection
• PALP: a package for analysing lattice polytopes with applications to toric geometry
• The representation polyhedron of a semiorder.
• Complexity and algorithms for computing Voronoi cells of lattices
• Title not available (Why is that?)
• PANDA: a software for polyhedral transformations
• Finding the Exact Integrality Gap for Small Traveling Salesman Problems
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Combinatorial integral approximation
• Identification of unidentified equality constraints for integer programming problems
• Projections of polytopes and the generalized Baues conjecture
• Title not available (Why is that?)
• Canonical modules of certain edge subrings
• Integer programming approach to static monopolies in graphs
• The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
• Facets for the single node fixed-charge network set with a node set-up variable
• Title not available (Why is that?)
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• A duality theorem for the ic-resurgence of edge ideals
• Facets from gadgets
• 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
• Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
• One-adhesive polymatroids
• 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
• Accelerating Fourier–Motzkin elimination using bit pattern trees
• Exploiting Symmetries in Polyhedral Computations
• Title not available (Why is that?)
• Multi-commodity variable upper bound flow models
• A two-level graph partitioning problem arising in mobile wireless communications
• Interior point methods in DEA to determine non-zero multiplier weights

This page was built for software: PORTA