murmur 发表于 2025-3-27 00:41:01

http://reply.papertrans.cn/23/2300/229957/229957_31.png

无畏 发表于 2025-3-27 03:18:45

Top-, List Aggregation: Mathematical Formulations and Polyhedral Comparisonsystems. Since multiple top-. lists may be generated by different algorithms to evaluate the same set of entities or system of interest, there is often a need to consolidate this collection of heterogeneous top-. lists to obtain a more robust and coherent list. This work introduces various exact math

有效 发表于 2025-3-27 07:08:35

http://reply.papertrans.cn/23/2300/229957/229957_33.png

cacophony 发表于 2025-3-27 13:13:51

http://reply.papertrans.cn/23/2300/229957/229957_34.png

LEVY 发表于 2025-3-27 17:07:12

Few Induced Disjoint Paths for ,-Free Graphs-. problem is to decide if a graph . with . pairs of specified vertices . contains . mutually induced paths . such that each . starts from . and ends at .. Whereas the non-induced version is well-known to be polynomial-time solvable for every fixed integer ., a classical result from the literature s

osculate 发表于 2025-3-27 19:43:34

http://reply.papertrans.cn/23/2300/229957/229957_36.png

追踪 发表于 2025-3-27 23:12:21

Piecewise Linearization of Bivariate Nonlinear Functions: Minimizing the Number of Pieces Under a Botion error. Applications include the approximation of mixed integer nonlinear optimization problems into mixed integer linear ones that are in general easier to solve. A framework to build dedicated linearization algorithms is introduced, and a comparison to the state of the art heuristics shows the

Dealing 发表于 2025-3-28 05:57:04

Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimar branch-and-bound (.) and the LP/NLP based branch-and-bound (.). A detrimental anomaly is when a parallel algorithm performs worse than its sequential counterpart. Unambiguous node selection functions have been developed in the past to avoid these anomalies. We extend this notion of unambiguity to

COMMA 发表于 2025-3-28 07:34:08

Exact Price of Anarchy for Weighted Congestion Games with Two Playersions. The results are exact price of anarchy bounds, which are parametric in the weights of the two players, and establish exactly how the attributes of the game enter into the quality of equilibria. Interestingly, some of the worst-cases are attained when the players’ weights only differ slightly.

桶去微染 发表于 2025-3-28 14:11:15

http://reply.papertrans.cn/23/2300/229957/229957_40.png
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: Combinatorial Optimization; 7th International Sy Ivana Ljubić,Francisco Barahona,A. Ridha Mahjoub Conference proceedings 2022 The Editor(s)