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.
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Boolean quadric polytopes are faces of linear ordering polytopes (Q2403680) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes (Q2691621) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- A Polyhedral Study of the Quadratic Traveling Salesman Problem (Q2806910) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- (Q4633022) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- The Multistatic Sonar Location Problem and Mixed-Integer Programming (Q4685800) (← links)
- Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment (Q4689763) (← links)
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions (Q4697093) (← links)
- Discrete equal-capacityp-median problem (Q4949164) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Tight Cycle Relaxations for the Cut Polytope (Q5020841) (← links)
- Introduction to QUBO (Q5050141) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- The Random QUBO (Q5050147) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
- Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems (Q5101403) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- (Q5203914) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- (Q5708566) (← links)