Pages that link to "Item:Q1122479"
From MaRDI portal
The following pages link to The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479):
Displaying 50 items.
- On the diameter of lattice polytopes (Q282757) (← links)
- On integer programming with bounded determinants (Q315478) (← links)
- The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Non-local energetics of random heterogeneous lattices (Q361406) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- A class of hypergraphs and vertices of cut polytope relaxations (Q416923) (← links)
- An integer linear programming approach for bilinear integer programming (Q435736) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- On a problem of integer optimization (Q926647) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- Min-cut clustering (Q1321669) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- The volume of relaxed Boolean-quadric and cut polytopes (Q1356562) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Relaxation optical bistability: A new class of optically bistable elements (Q1595496) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
