about
Minimal vertex covers on finite-connectivity random graphs: A hard-sphere lattice-gas pictureAssembly and Molecular Architecture of the Phosphoinositide 3-Kinase p85α Homodimer.Attentional modulation and selection--an integrated approach.FoXS, FoXSDock and MultiFoXS: Single-state and multi-state structural modeling of proteins and their complexes based on SAXS profiles.Systems biology: parameter estimation for biochemical models.A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.Learning directed acyclic graphs from large-scale genomics data.Fast approximations of the rotational diffusion tensor and their application to structural assembly of molecular complexes.Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs.Genetic forma recombination in permutation flowshop problems.Decision-theoretic refinement planning in medical decision making: management of acute deep venous thrombosis.Path-Planning with Avoidance Using Nonlinear Branch-and-Bound OptimizationNumber of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random GraphsLogistical routing of park tours with waiting times: case of Beijing ZooTikhonov, Ivanov and Morozov regularization for support vector machine learningOptimization Models and Methods for Demand-Side Management of Residential Users: A SurveyModified Biogeography-Based Optimization with Local Search MechanismBiogeography-Based Optimization with Orthogonal CrossoverA novel algorithm combining finite state method and genetic algorithm for solving crude oil scheduling problem
P2860
Q27345461-57A358AB-49EE-4118-851D-2CA779837C7CQ30009083-BBC6044E-12C6-4D0E-9331-996B99D18CC3Q35194654-CF5CF7D7-3E68-4916-84A9-671C01E27649Q37182134-04A095B7-ED99-45BF-9394-25F9B82875DEQ37392314-0B7FE4B4-0D83-4E97-8521-56EA2E664C21Q40305111-EC61973D-35D2-42C5-8102-D5ACF63E881CQ42361583-2412B7B1-D736-4C68-9F2E-2C194CE25A3CQ42758254-5AE6FF7F-8F7A-4CAB-8521-794F44B84BBDQ52066136-DFF86405-863A-4B4C-BC3A-3EB458BEC712Q52224160-DCCEE583-5C88-48BD-9267-210BEA639C94Q52295250-C5720EF9-64B9-4273-9420-8423FF19B519Q57591616-95140190-B2A7-4322-A4C7-B996CDDD1939Q58001614-D13BB4E5-3B9A-44B5-BF23-77668ADCB434Q58259347-F3085BAF-7341-45F0-B909-8E7453E25348Q58778430-EAE13200-85D1-4171-A38F-3D995E786523Q58827437-38504714-1A78-4088-83D5-8508FFC93020Q59007168-C036F74D-D661-4B33-ABD3-F463A4FA6FE4Q59023900-0F285F97-B37F-41A8-9DC9-CCA1F6FD79B2Q59100675-110BB7E6-B323-4CB7-B12D-AE870F53DE23
P2860
description
im August 1966 veröffentlichter wissenschaftlicher Artikel
@de
wetenschappelijk artikel
@nl
наукова стаття, опублікована в серпні 1966
@uk
name
Branch-and-Bound Methods: A Survey
@en
Branch-and-Bound Methods: A Survey
@nl
type
label
Branch-and-Bound Methods: A Survey
@en
Branch-and-Bound Methods: A Survey
@nl
prefLabel
Branch-and-Bound Methods: A Survey
@en
Branch-and-Bound Methods: A Survey
@nl
P356
P1433
P1476
Branch-and-Bound Methods: A Survey
@en
P2093
D. E. Wood
E. L. Lawler
P304
P356
10.1287/OPRE.14.4.699
P577
1966-08-01T00:00:00Z