Some efficiently solvable problems over integer partition polytopes

DOI10.1016/J.DAM.2014.08.015zbMATH Open1303.05012OpenAlexW1978661177MaRDI QIDQ476314FDOQ476314

Authors: Shmuel Onn, Vladimir A. Shlyk 

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.015

Recommendations

• Polytopes of partitions of numbers
• Projection results for the \(k\)-partition problem
• Vertex characterization of partition polytopes of bipartitions and of planar point sets
• The partition problem
• Primal separation algorithms

zbMATH Keywords

integer partitionsinteger partition polytopeseparation problemvertex adjacency

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Geometric algorithms and combinatorial optimization.
• Enumerative combinatorics. Volume 2.
• Title not available (Why is that?)
• Polyhedral proof methods in combinatorial optimization
• Polytopes of partitions of numbers
• Polyhedral Characterization of Discrete Dynamic Programming
• Optimal integer partitions
• Polyhedral approach to integer partitions
• Large sparse numerical optimization

Cited In (13)

• A formulation of the wide partition conjecture using the atom problem in discrete tomography
• Title not available (Why is that?)
• On the complexity of Hilbert refutations for partition
• Title not available (Why is that?)
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
• Optimal Dorfman group testing for symmetric distributions
• Combinatorial operations for the generation of vertices of integer partition polytopes
• Extension complexity of formal languages
• Well-solvable instances for the partition problem
• Feasible partition problem in reverse convex and convex mixed-integer programming
• Application of regular partitions in integer programming
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number

This page was built for publication: Some efficiently solvable problems over integer partition polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476314)