scientific article; zbMATH DE number 1302175
From MaRDI portal
Publication:4247442
Recommendations
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- A revised reformulation-linearization technique for the quadratic assignment problem
- scientific article; zbMATH DE number 1857670
Cited in
(28)- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
- Two new reformulation convexification based hierarchies for 0-1 MIPs
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Models and algorithms for the product pricing with single-minded customers requesting bundles
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Matroid optimization problems with monotone monomials in the objective
- RLT insights into lift-and-project closures
- A revised reformulation-linearization technique for the quadratic assignment problem
- A unified model for Weber problems with continuous and network distances
- A global optimization RLT-based approach for solving the hard clustering problem
- A reformulation-linearization technique for optimization over simplices
- On throughput maximization problem for UWB-based sensor networks via reformulation-linearization technique
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- scientific article; zbMATH DE number 5898062 (Why is no real title available?)
- scientific article; zbMATH DE number 432992 (Why is no real title available?)
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- scientific article; zbMATH DE number 1857670 (Why is no real title available?)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- A complementary column generation approach for the graph equipartition problem
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- Integrating lot-sizing and pricing decisions in multi-channel markets with discrete menus of prices
- Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope
- A survey for the quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247442)
