Searcharxiv⌕ Search

arXiv subjects

Erwin Pesch

Publications and source records attributed to Erwin Pesch.

3 recordsLinked to original sources

Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling

Branch-and-Bound (B&B) and $A^*$ are popular exact search methods originating from Operations Research and Artificial Intelligence, respectively. Although the two methods share fundamental search principles, their different ways of exploring the search space can lead to substantially different computational performance. We investigate these differences using the Resource-Constrained Project Scheduling Problem (RCPSP) as an exemplary problem setting. We first establish the relationships between mixed-integer linear programming, state-action, and timed Petri-net representations. Since B&B and $A^*$ admit numerous algorithmic enhancements, we focus on relatively basic implementations. This allows us to examine the fundamental differences between the methods rather than compare the performance of state-of-the-art solvers. By using the same lower bound and best-first node selection, we isolate the effects of the search mechanisms, particularly the identification of equivalent states reached through different scheduling decision sequences. Experiments on 480 benchmark RCPSP instances show that graph-based $A^*$ substantially outperforms the B&B variants considered. With additional pruning rules, $A^*$ proves optimality for all 480 instances, compared with 445 for best-first B&B under the same time and memory limits. Depth-first B&B uses less memory and can find feasible solutions even when the search does not finish within the time limit. Stronger linear programming relaxations reduce the search space but introduce considerable computational overhead. Our findings highlight the importance of duplicate-state detection and clarify the computational trade-offs between the search approaches. These insights can help researchers select an appropriate method and identify opportunities to incorporate effective mechanisms from one approach into the other.

math.OC↗

Robust single-stage selection problems with budgeted interval uncertainty

We study single-stage decision problems in which a subset of items with minimum total cost has to be selected at once from a given set of items, subject to two costs of each item -fixed and uncertain -and cardinality constraints for each cost type. The worst-case budgeted interval uncertainty is considered. At the time of decision making, the fixed costs are known, but for each uncertain cost, only the range of its values is available. Similar but two-stage selection problems have been studied in the literature, in which first-and second-stage decisions are made before and after uncertain costs become known, respectively. The problems studied are distinguished by continuous or discrete uncertain costs, and by uncertainty budgets based on cardinality or volume. An almost complete computational complexity classification is provided, including fast polynomial-time algorithms, NP-and $Σ$ p 2 -completeness and hardness proofs. keyword robust optimization -budgeted uncertainty -selection problem -dynamic programming -computational complexity

math.OC↗

Brilliant Challenges Optimization Problem Submission Contest Final Report

This paper concludes the Brilliant Challenges contest. Participants had to design interesting optimization problems and publish them using the Optil.io platform. It was the first widely-advertised contest in the area of operational research where the objective was to submit the problem definition instead of the algorithmic solutions. Thus, it is a crucial contribution to Open Science and the application of crowdsourcing methodology to solve discrete optimization problems. The paper briefly describes submitted problems, presents the winners, and discusses the contest's achievements and shortcomings. Finally, we define guidelines supporting the organization of contests of similar type in the future.

cs.OH↗