思乡病 发表于 2025-3-28 15:57:28

http://reply.papertrans.cn/47/4683/468258/468258_41.png

periodontitis 发表于 2025-3-28 19:24:18

Secretary Problems via Linear Programming,s basic concept of . elements arriving in a random order and irrevocable decisions made by an algorithm have been explored extensively over the years, and used for modeling the behavior of many processes. Our main contribution is a new linear programming technique that we introduce as a tool for obt

Pert敏捷 发表于 2025-3-28 23:50:03

http://reply.papertrans.cn/47/4683/468258/468258_43.png

Freeze 发表于 2025-3-29 06:14:20

http://reply.papertrans.cn/47/4683/468258/468258_44.png

高原 发表于 2025-3-29 07:36:27

Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems,e-disjoint path problems MEDP(ℓ) and MNDP(ℓ), the task is to find the maximum number of edge- or node-disjoint ℓ-bounded (.,.)-paths in a given graph . with source . and sink ., respectively. In the weighted edge- or node-disjoint path problems WEDP(ℓ) and WNDP(ℓ), we are also given an integer . ∈ ℕ

V切开 发表于 2025-3-29 12:11:58

A Polynomial-Time Algorithm for Optimizing over ,-Fold 4-Block Decomposable Integer Programs,e show that for fixed blocks but variable ., these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable . and any convex separable objective function. We conclude with t

arthroplasty 发表于 2025-3-29 17:28:28

Universal Sequencing on a Single Machine,rsal solution that performs well without adaptation for any possible machine behavior. For the objective of minimizing the total weighted completion time, we design a polynomial time deterministic algorithm that finds a universal scheduling sequence with a solution value within 4 times the value of

Cardiac 发表于 2025-3-29 21:11:53

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm,s on the previously best known 2.076-approximation algorithm of Swamy & Shmoys. To the best of our knowledge, our work provides the first application of a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for

defenses 发表于 2025-3-30 03:42:19

http://reply.papertrans.cn/47/4683/468258/468258_49.png

爆炸 发表于 2025-3-30 05:51:13

http://reply.papertrans.cn/47/4683/468258/468258_50.png
页: 1 2 3 4 [5] 6
查看完整版本: Titlebook: Integer Programming and Combinatorial Optimization; 14th International C Friedrich Eisenbrand,F. Bruce Shepherd Conference proceedings 2010