PORTA

swMATH4869MaRDI QIDQ17024

No author found.

Described by source

• Combinatorial optimization and small polytopes

Related Items (only showing first 100 items - show all)

Finiteness of relative equilibria of the four-body problem ⋮ The 2D subarray polytope ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ Finding the Exact Integrality Gap for Small Traveling Salesman Problems ⋮ Gear Composition of Stable Set Polytopes and 𝒢-Perfection ⋮ Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs ⋮ Bayes factors for state-trace analysis ⋮ MIP reformulations of the probabilistic set covering problem ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm ⋮ Unnamed Item ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An approval-voting polytope for linear orders ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Complete formulations of polytopes related to extensions of assignment matrices ⋮ Unnamed Item ⋮ Lifting the knapsack cover inequalities for the knapsack polytope ⋮ Optimizing over the first Chvátal closure ⋮ Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing ⋮ The linear ordering problem. Exact and heuristic methods in combinatorial optimization. ⋮ Small bipartite subgraph polytopes ⋮ On the polyhedral structure of uniform cut polytopes ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields ⋮ Individual differences in the algebraic structure of preferences ⋮ Canonical modules of certain edge subrings ⋮ The stable set polytope of icosahedral graphs ⋮ Unnamed Item ⋮ The representation polyhedron of a semiorder. ⋮ A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions ⋮ PANDA: a software for polyhedral transformations ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ Combinatorial integral approximation ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Facets of linear signed order polytopes. ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Weak order polytopes. ⋮ On a generalization of the master cyclic group polyhedron ⋮ Strong and compact relaxations in the original space using a compact extended formulation ⋮ Facets for the single node fixed-charge network set with a node set-up variable ⋮ Facets from gadgets ⋮ Some facets of the polytope of even permutation matrices. ⋮ Limited memory rank-1 cuts for vehicle routing problems ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ Extended formulations for order polytopes through network flows ⋮ The Polytope ofm-Subspaces of a Finite Affine Space ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ The hypermetric cone and polytope on eight vertices and some generalizations ⋮ Intermediate integer programming representations using value disjunctions ⋮ Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ 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 ⋮ Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets ⋮ Identification of unidentified equality constraints for integer programming problems ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ Series-parallel graphs are windy postman perfect ⋮ Interior point methods in DEA to determine non-zero multiplier weights ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ On the separation of disjunctive cuts ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The biorder polytope ⋮ On a recognition problem on cut polytope relaxations ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ PALP: a package for analysing lattice polytopes with applications to toric geometry ⋮ Optimizing over the First Chvàtal Closure ⋮ On packing and covering polyhedra of consecutive ones circulant clutters ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ Primary facets of order polytopes ⋮ Vertex adjacencies in the set covering polyhedron ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ⋮ Finiteness of stationary configurations of the four-vortex problem ⋮ A branch-and-cut algorithm for the target visitation problem ⋮ The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect ⋮ Radial Level Planarity Testing and Embedding in Linear Time ⋮ Projections of polytopes and the generalized Baues conjecture ⋮ Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems ⋮ 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 ⋮ On cutting planes for cardinality-constrained linear programs ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ Quasi-semi-metrics, oriented multi-cuts and related polyhedra ⋮ Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference ⋮ 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 ⋮ On the facets and diameter of thek-cycle polytope ⋮ On the facial structure of symmetric and graphical traveling salesman polyhedra ⋮ On the separation of split inequalities for non-convex quadratic integer programming ⋮ The 2-edge-connected subgraph polyhedron ⋮ Classification of eight-dimensional perfect forms ⋮ Mixed integer models for the stationary case of gas network optimization ⋮ Formulating logical implications in combinatorial optimisation ⋮ Cutting planes for RLT relaxations of mixed 0-1 polynomial programs ⋮ A duality theorem for the ic-resurgence of edge ideals ⋮ On the combinatorial structure of the approval-voting polytope ⋮ The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity ⋮ Unnamed Item

This page was built for software: PORTA