Portal de Periódicos da CAPES

Letter to the Editor—A Note on the Branch-and-Bound Principle

1968; Institute for Operations Research and the Management Sciences; Volume: 16; Issue: 2 Linguagem: Inglês

10.1287/opre.16.2.442

1526-5463

Egon Balas,

Vehicle Routing Optimization Methods

Free AccessAboutSectionsView PDF ToolsAdd to favoritesDownload CitationsTrack CitationsPermissionsReprints ShareShare onFacebookTwitterLinked InEmail Go to SectionFree Access HomeOperations ResearchVol. 16, No. 2 Letter to the Editor—A Note on the Branch-and-Bound PrincipleEgon BalasEgon BalasPublished Online:1 Apr 1968https://doi.org/10.1287/opre.16.2.442 Previous Back to Top Next FiguresReferencesRelatedInformationCited byMethods for the solution of systems of nonlinear algebraic equations and functions’ minimization tasks: elements of theory and applications1 January 2023Branch-and-Bound Methods8 August 2014General Bibliography8 August 2014Phasor Measurement Unit Placement for Identifying Power Line Outages in Wide-Area Transmission System MonitoringBranch‐and‐Bound Methods21 January 2013Dominance rules in combinatorial optimization problemsEuropean Journal of Operational Research, Vol. 212, No. 3Branch-and-Bound Algorithms14 January 2011References10 November 2009An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplaneApplied Mathematics and Computation, Vol. 185, No. 1Effectiveness of the Nash strategies in competitive multi-team target assignment problemsIEEE Transactions on Aerospace and Electronic Systems, Vol. 43, No. 1Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, Vol. 306, No. 10-11BibliographyEffectiveness of the Nash strategies in competitive multi-team target assignment problemsCombinatorial Reliability OptimizationBerücksichtigung des Risikos in der Investitionsentscheidung — Insbesondere Darstellung des Substitutionalen Ansatzes (Multiple Zielsetzung) und des EntscheidungsbaumverfahrensGroundwater Remediation Design Using a Three‐Dimensional Simulation Model and Mixed‐Integer Programming9 July 2010 | Water Resources Research, Vol. 31, No. 5ULYSSES: A lattice-based multiple interaction strategy retrieval interface2 June 2005Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems6 March 2007 | International Journal of Robust and Nonlinear Control, Vol. 1, No. 4Branch-and-bound as a higher-order functionAnnals of Operations Research, Vol. 33, No. 5Branch-and-Bound TechniquesA continuous approach to nonlinear integer programmingApplied Mathematics and Computation, Vol. 34, No. 1Entscheidungslehre und EntscheidungsbaumverfahrenA Methodology Based on Reduced Complexity Algorithm for System Applications using MicroprocessorsPostoptimality analysis for a network protocol feature specification modelComputers & Industrial Engineering, Vol. 9, No. 4Parallel Branch-and-Bound Formulations for AND/OR Tree SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-6, No. 6Random Trees and the Analysis of Branch and Bound Procedures1 January 1984 | Journal of the ACM, Vol. 31, No. 1A general branch and bound formulation for understanding and synthesizing and/or tree search proceduresArtificial Intelligence, Vol. 21, No. 1-2An effective structured approach to finding optimal partitions of networksComputing, Vol. 29, No. 3Scheduling Problems and Combinatorial ProgrammingA multiplication-free solution for linear minimum mean-square estimation and equalization using the branch-and-bound principleIEEE Transactions on Information Theory, Vol. 26, No. 3Branch-and-bound procedure and state—space representation of combinatorial optimization problemsInformation and Control, Vol. 36, No. 1The Power of Dominance Relations in Branch-and-Bound Algorithms1 April 1977 | Journal of the ACM, Vol. 24, No. 2Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Computer & Information Sciences, Vol. 5, No. 4A Markovian Decision Model for Clinical Diagnosis and Treatment Applied to the Respiratory SystemIEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-6, No. 9Discrete solutions to engineering design problemsJournal of Engineering Mathematics, Vol. 9, No. 1References††The first comprehensive references list is due to Balinski and Spielberg (1969). A later list appears in the work of Garfinkel and Nemhauser (1972b).Two problems of optimal allocation of productionCybernetics, Vol. 7, No. 3SUPPLEMENTARY READINGAn algorithm for separable piecewise convex programming problemsNaval Research Logistics Quarterly, Vol. 20, No. 2Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, Vol. 4, No. 4A heuristic approach to combinatorial optimization problems24 May 2005An algorithm for determining the least minimum singular value of a polytope of matricesA fast algorithm for unit level team resource allocation in a game environmentEin lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger ProgrammierungsaufgabenUnternehmensforschung Operations Research - Recherche Opérationnelle, Vol. 13, No. 2Procédure d'exploration par séparation et évaluation29 March 2011 | Revue française d'informatique et de recherche opérationnelle. Série verte, Vol. 3, No. V1 Volume 16, Issue 2March-April 1968Pages 227-454 Article Information Metrics Information Published Online:April 01, 1968 © 1968 INFORMSCite asEgon Balas, (1968) Letter to the Editor—A Note on the Branch-and-Bound Principle. Operations Research 16(2):442-445. https://doi.org/10.1287/opre.16.2.442 PDF download