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 34 items.
- (Q5869388) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- The cut cone. III: On the role of triangle facets (Q5905548) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- The cut cone. III: On the role of triangle facets (Q5919846) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- Polyhedral methods for piecewise-linear functions. I: The lambda method (Q5929311) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- The QAP-polytope and the star transformation (Q5939231) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- An efficient model for the multiple allocation hub maximal covering problem (Q6078427) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- Optimal design of line replaceable units (Q6150236) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- On skeletons, diameters and volumes of metric polyhedra (Q6567675) (← links)
- On different versions of the exact subgraph hierarchy for the stable set problem (Q6585245) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
- Piecewise polyhedral relaxations of multilinear optimization (Q6622747) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)