An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-13036-6_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

An Algorithm for Indefinite Quadratic Programming With Convex Constraints

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1991English

An All-Integer Integer Programming Algorithm

1963English

A Two-Stage Parallel Branch and Bound Algorithm for Mixed Integer Programs

IMA Journal of Management Mathematics
ManagementFinanceApplied MathematicsEconomicsSimulationManagement ScienceManagement Information SystemsModelingStrategyEconometricsOperations Research
2004English

An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Integer Quadratic Programming in the Plane

2013English

A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming

Journal of Applied Mathematics
Applied Mathematics
2013English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Bound Constrained Quadratic Programming via Piecewise Quadratic Functions

Mathematical Programming, Series B
MathematicsSoftware
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy