Resistant Sets in the Unit Hypercube

DOI10.1287/moor.2019.1048zbMath1469.90119OpenAlexW2997603461MaRDI QIDQ4991667

Cornuéjols, Gérard, Dabeen Lee, Ahmad Abdi

Publication date: 3 June 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/102397/1/resistant.pdf

zbMATH Keywords

packing propertyset-covering polyhedronideal clutterscuboidsreplication conjecture

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

Idealness and 2-resistant sets ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems ⋮ Testing idealness in the filter oracle model

Uses Software

• cuboids-code

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• \((0,\pm 1)\) ideal matrices
• Cropped cubes
• A characterization of weakly bipartite graphs
• Cuboids, a class of clutters
• Idealness and 2-resistant sets
• Combinatorial Optimization
• Perfect and Ideal 0, ±1 Matrices
• Delta Minors, Delta Free Clutters, and Entanglement
• Lehman's Theorem and the Directed Steiner Tree Problem
• Matching, Euler tours and the Chinese postman
• Ideal Clutters That Do Not Pack
• Forbidden Vertices
• Optimum branchings
• Bottleneck extrema
• Balanced matrices
• Blocking and anti-blocking pairs of polyhedra
• The packing property.

This page was built for publication: Resistant Sets in the Unit Hypercube