Box-constrained quadratic programs with fixed charge variables (Q933786): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-007-9167-8 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Capacitated facility location: Separation algorithms and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for solving general quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Complementarity Knapsack Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound improvement and forcing rule for quadratic binary programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-constrained quadratic programs with fixed charge variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bounds and optimality cuts for all-quadratic programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seizure warning algorithm based on optimization and nonlinear dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-007-9167-8 / rank
 
Normal rank

Latest revision as of 08:46, 10 December 2024

scientific article
Language Label Description Also known as
English
Box-constrained quadratic programs with fixed charge variables
scientific article

    Statements

    Box-constrained quadratic programs with fixed charge variables (English)
    0 references
    0 references
    0 references
    25 July 2008
    0 references
    The mixed integer program of the form \[ \max x^TQx+ C^tx- f^t\delta,\qquad\text{s.t. }0\leq x\leq \delta, \] \[ x\in\mathbb{R}^n,\quad \delta\in\{0,1\}^n,\quad Q\in\mathbb{R}^{n\times n},\quad c,f\in \mathbb{R}^n \] is studied and a branch-and-cut algorithm is given. Furthermore, there are lots of theoretical results and connections with similar problems.
    0 references
    Branch-and-cut
    0 references
    Quadratic programming
    0 references
    Global Optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers