Search Results - subject_exact:"Branch-and-Bound"

Trade-off between utility and fairness in two-agent single-machine scheduling

Agnetis, Alessandro; Benini, Mario; Nicosia, Gaia; … - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015432925

Optimizing the path towards plastic-free oceans

Hertog, Dirk den; Pauphilet, Jean; Pham, Yannick; … - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015445699

A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem

Álvarez-Miranda, Eduardo; Pereira, Jordi; Vilà, Mariona - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014563804

Scheduling a single machine with multiple due dates per job

Kühn, Raphael; Weiß, Christian; Ackermann, Heiner; … - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015123355

An efficient branch-and-bound algorithm to optimize a function over a nondominated set

Zerfa, Lamia; Chergui, Mohamed El-Amine - 2026

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015482814

Bilinear branch and check for unspecified parallel machine scheduling with shift consideration

Jartnillaphand, Ponpot; Mardaneh, Elham; Bui, Hoa T. - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015085083

Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem

Zhang, Xiechen; Angel, Eric; Chu, Feng; Regnault, Damien - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015408276

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning

Coll, Jordi; Li, Chu-Min; Li, Shuolin; Habet, Djamal; … - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015472531

A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints

Watermeyer, Kai; Zimmermann, Jürgen - 2023

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014265740

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem

Belyi, Alexander; Sobolevsky, Stanislav; Kurbatski, … - 2023

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014423853

Solving linear multiplicative programs via branch-and-bound : a computational experience

Cambini, Riccardo; Riccardi, R.; Scopelliti, D. - 2023

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014393412

Probabilistic branch and bound considering stochastic constraints

Huang, Hao; Tsai, Shing Chih; Park, Chuljin - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015094943

Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects

Zhang, Yurong; Sun, Xinyu; Liu, Tao; Wang, Jiayin; … - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015325337

An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints

Pamuk, Bahadır; Öncan, Temel; Altınel, İ. Kuban - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015433055

Scheduling a two-stage assembly problem with separated setup time to minimise total tardiness

Luo, JianChao; Liu, ZhiQiang; Fan, JiaLi; Wang, Jun-Qiang; … - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015445145

Single machine scheduling with variable maintenance in the battery manufacturing

Lee, Sang-Wook; Kim, Hyun-Jung - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015555551

An exact algorithm for the Minimum Gap Graph Partitioning Problem

Bruglieri, Maurizio; Consiglio, Gianluca; Cordone, Roberto - 2025

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015519648

A machine learning-based selection approach for solving the single machine scheduling problem with Early/Tardy jobs

Abdessemed, Ahmed-Adnane; Mouss, Leila Hayet; … - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014635216

Solving the Set Covering Problem with Conflicts on Sets : a new parallel GRASP

Carrabs, Francesco; Cerulli, Raffaele; Mansini, Renata; … - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014564988

A branch-and-bound algorithm with growing datasets for large-scale parameter estimation

Sass, Susanne; Mitsos, Alexander; Bongartz, Dominik; … - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014566295

Learning-accelerated mixed-integer quadratic programming for unit commitment

Maisonneuve, Philippe; Lesage-Landry, Antoine - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014483361

An exploration of quantitative models and algorithms for vehicle routing optimization and traveling salesman problems

Lähdeaho, Oskari; Hilmola, Olli-Pekka - 2024

This study presents optimization models for large vehicle routing problems using a spreadsheet solver and Python programming language with extended graphic card boosting computing power. Near optimality is feasible and attainable with spreadsheet tools and models for solving real-life problems....

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014516546

Augmenting bi-objective branch and bound by scalarization-based information

Bauß, Julius; Stiglmayr, Michael - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015126893

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Caselli, Giulia; Delorme, Maxence; Iori, Manuel; Magni, … - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014560645

Some new clique inequalities in four-index hub location models

Landete, Mercedes; Peiró, Juanjo - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015048157

On upper bounds for the multiple knapsack assignment problem

Galli, Laura; Letchford, Adam N. - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10015049293

A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem

Parragh, Sophie N.; Tricoire, Fabien; Gutjahr, Walter J. - 2022

Persistent link: https://ebvufind01.dmz1.zbw.eu/10013277567

Packing-based branch-and-bound for discrete malleable task scheduling

Braune, Roland - 2022

Persistent link: https://ebvufind01.dmz1.zbw.eu/10013453989

An SDP-based approach for computing the stability number of a graph

Gaar, Elisabeth; Siebenhofer, Melanie; Wiegele, Angelika - 2022

Persistent link: https://ebvufind01.dmz1.zbw.eu/10013184228

A Branch-and-Bound Algorithm for the Proactive Resource-Constrained Project Scheduling Problem with Robustness Maximization Objective

Li, Xue; He, Zheng; Wang, Nengmin - 2023

This paper proposes a branch-and-bound algorithm (B&B) for the proactive scheduling problem, which incorporates a degree of anticipation for variability in practical projects. First, the resource-constrained proactive scheduling model is formulated. Second, solving its resource-unconstrained...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014259746

Solving the Traveling Salesman Problem with release dates via branch and cut

Montero, Agustín; Méndez-Díaz, Isabel; … - 2023

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014518066

A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing

Liu, Lindong; Wu, Zhenyu; Yu, Yugang - 2023

Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014315969

Target-oriented robust satisficing models for the single machine scheduling problems with release time

Zhang, Xun; Du Chen - 2024

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014565104

Show one more version 1

Target-oriented Robust Satisficing Models for the Single Machine Scheduling Problems with Release Time

Zhang, Xun; Du Chen - 2023

Book / Working Paper

A Socp Relaxation Based Branch-and-Bound Algorithm for Solving a Class of Generalized Sum-of-Linear-Fractions Programming Problems

Zhang, Bo; Wang, Hongyu; Gao, Yuelin - 2023

This paper mainly studies a class of generalized sum-of-linear-fractions programming problems which have important applications in finance, economy and computational vision. In this process, we first propose a new method to re-represent the original problem as an equivalent problem (EP) with...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014360023

An Exact Algorithm for Technician Scheduling Problem with Release Times

Liu, Hengling; Liu, Zhenyuan; Chen, Ruiying; Zhou, Zinuo - 2023

To solve the technician scheduling problem, this paper establishes a technician scheduling model considering the task release time, and designs a branch delimitation algorithm to solve the problem accurately by fully utilizing each technician's skills and allocating limited human resources to...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014360196

Minimizing the Sum of Earliness and Tardiness in the Multi-Factory Two-Stage Assembly Scheduling Problem

Kazemi, Hamed; Nourelfath, M.; Gendreau, Michel - 2023

The geographical dispersion of collaborative factories may provide the cost-saving potential for manufacturers and lead them to easier fit the global markets. On the other hand, in such networks of factories, coordination is very important for the just-in-time delivery of orders. This study...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014360834

Branch, Bound & Cut Algorithm for the Competitive Facility Location Problem with Income Targeting

Beresnev, Vladimir; Melnikov, Andrey - 2023

We consider a competitive facility location model with uncertain customers’ parameters. The model is built on the base of a Stackelberg game framework where competing parties (the Leader and the Follower) sequentially decide on opening their facilities. In the model, the Leader does not have a...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014361139