Pages that link to "Item:Q1123806"
From MaRDI portal
The following pages link to Experiments in quadratic 0-1 programming (Q1123806):
Displaying 50 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- On the number of local maxima in quadratic 0-1 programs (Q2367394) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Rapid screening algorithms for stochastically constrained problems (Q2400026) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- An effective compact formulation of the max cut problem on sparse graphs (Q2840693) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
