Pages that link to "Item:Q703274"
From MaRDI portal
The following pages link to A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274):
Displayed 35 items.
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Electroencephalogram (EEG) time series classification: applications in epilepsy (Q863612) (← links)
- On the time series support vector machine using dynamic time warping kernel for brain activity classification (Q946725) (← links)
- Linearization of a 0-1 quadratic fractional programming problem (Q998699) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods (Q1730620) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- Stochastic single-allocation hub location (Q2029287) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- A hybrid approach for designing a railway transportation network of hazardous material tanks (Q2110009) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Time—Frequency Analysis of Brain Neurodynamics (Q3565462) (← links)
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM (Q3632032) (← links)
- On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)