Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Birgit Wöstmann
A Branch & Bound Algorithm for the Open-Shop Problem
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Related publications
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Optimization Letters
Control
Optimization
Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem
International Journal of Applied Information Systems
A Branch-And-Bound Method for the Multichromosomal Reversal Median Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for the Multiprocessor Open Shop Scheduling Problem
Operations Research Letters
Industrial
Applied Mathematics
Manufacturing Engineering
Management Science
Operations Research
Software
A Genetic Algorithm for a Bicriteria Flow-Shop Scheduling Problem
Transactions of the Institute of Systems, Control and Information Engineers
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
The Stage Shop Scheduling Problem: Lower Bound and Metaheuristic
Scientia Iranica
A Lagrangian-Based Branch-And-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem With Single-Assignment Constraints
Transportation Science
Civil
Transportation
Structural Engineering
A Branch-And-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
IEEE Transactions on Signal Processing
Electronic Engineering
Signal Processing
Electrical
