Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Maria C. Carrera
A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,
Related publications
A Branch-And-Bound-Based Crossover Operator for the Traveling Salesman Problem
International Journal of Cognitive Informatics and Natural Intelligence
Human-Computer Interaction
Artificial Intelligence
Software
A Two-Phase Heuristic for Set Covering
International Journal of Mathematics in Operational Research
Modeling
Decision Sciences
Simulation
A Branch-And-Bound Approach for Tautomer Enumeration
Journal of Cheminformatics
Computer Graphics
Information Sciences
Library
Theoretical Chemistry
Computer Science Applications
Computer-Aided Design
Physical
Tolerance Design of Analog Circuits Using a Branch-And-Bound Based Approach
Journal of Circuits, Systems and Computers
Hardware
Electronic Engineering
Electrical
Architecture
A Finite Set Covering Theorem III
Bulletin of the Australian Mathematical Society
Mathematics
Technical Note—On Partitioning the Feasible Set in a Branch-And-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
Operations Research
Management Science
Computer Science Applications
Operations Research
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
A Branch-And-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
IEEE Transactions on Signal Processing
Electronic Engineering
Signal Processing
Electrical
Lsmear: A Variable Selection Strategy for Interval Branch and Bound Solvers
Journal of Global Optimization
Control
Optimization
Applied Mathematics
Management Science
Computer Science Applications
Operations Research
