Pages that link to "Item:Q2300162"
From MaRDI portal
The following pages link to Submodular minimization under congruency constraints (Q2300162):
Displaying 17 items.
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- On the recognition of \(\{a,b,c\}\)-modular matrices (Q2061884) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Submodular minimization under congruency constraints (Q2300162) (← links)
- Congruence submodularity (Q4430921) (← links)
- (Q4607937) (redirect page) (← links)
- A submodular optimization problem with side constraints (Q4645927) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases (Q5099099) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms (Q6565387) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
