GitHub

Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling

This project implements a Branch and Bound (B&B) algorithm to solve the Agile Earth Observation Satellite Scheduling (AEOSS) problem — a complex NP-hard combinatorial optimization challenge. The ...
GitHub

Branch and Bound for Capacitated Facility Location under Strict Preferences (CFLP-SP)

This repository contains code relating to the paper "A Combinatorial Branch-and-Bound Algorithm for the Capacitated Facility Location Problem under Strict Customer Preferences" by Christina Büsing, ...
JSTOR Daily

A Branch and Bound Algorithm for Disassembly Scheduling with Assembly Product Structure

This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the ...
IEEE

A Branch and Bound Algorithm for Low Rank Multiplicative Nonconvex Minimization Problem

Abstract: In this paper, we discuss a practical branch and bound algorithm for solving rank-p linear multiplicative programming problem (LMP). We will show that the programming problem can be solved ...
IEEE

A Branch and Bound Algorithm for Minimizing Total Tardiness of a Two-Stage Assembly Problem

Abstract: Existing algorithms for the two-stage assembly scheduling problem (TASP) ignores the setup time and depends on four or more fine-tuned parameters. This work focuses on TASPs with separated ...
JSTOR Daily

Some Applications of the "Branch-and-Bound" Algorithm to the Machine Scheduling Problem

The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...