A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,

doi 10.21236/ada257416
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

A Branch-And-Bound-Based Crossover Operator for the Traveling Salesman Problem

International Journal of Cognitive Informatics and Natural Intelligence
Human-Computer InteractionArtificial IntelligenceSoftware
2019English

A Two-Phase Heuristic for Set Covering

International Journal of Mathematics in Operational Research
ModelingDecision SciencesSimulation
2018English

A Branch-And-Bound Approach for Tautomer Enumeration

Journal of Cheminformatics
Computer GraphicsInformation SciencesLibraryTheoretical ChemistryComputer Science ApplicationsComputer-Aided DesignPhysical
2010English

Tolerance Design of Analog Circuits Using a Branch-And-Bound Based Approach

Journal of Circuits, Systems and Computers
HardwareElectronic EngineeringElectricalArchitecture
2012English

A Finite Set Covering Theorem III

Bulletin of the Australian Mathematical Society
Mathematics
1972English

Technical Note—On Partitioning the Feasible Set in a Branch-And-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1973English

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

English

A Branch-And-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2013English

Lsmear: A Variable Selection Strategy for Interval Branch and Bound Solvers

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy