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

Operations Research- United States

doi 10.1287/opre.19.4.1036

Full Text

Abstract

Available in

Date

Authors

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

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

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

Chvátal Closures for Mixed Integer Programming Problems

Mathematical Programming, Series B
MathematicsSoftware
1990Danish

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems

American Journal of Operations Research
2011English

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

Journal of Applied Mathematics
Applied Mathematics
2013English

Lattice Preconditioning for the Real Relaxation Branch-And-Bound Approach for Integer Least Squares Problems

Journal of Global Optimization
ControlOptimizationApplied MathematicsManagement ScienceComputer Science ApplicationsOperations Research
2014English

An All-Integer Integer Programming Algorithm

1963Norwegian Bokmål

A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science
Management ScienceManagementOperations ResearchStrategy
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy