找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Integer Programming and Combinatorial Optimization; 14th International C Friedrich Eisenbrand,F. Bruce Shepherd Conference proceedings 2010

[复制链接]
楼主: industrious
发表于 2025-3-28 15:57:28 | 显示全部楼层
发表于 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
发表于 2025-3-28 23:50:03 | 显示全部楼层
发表于 2025-3-29 06:14:20 | 显示全部楼层
发表于 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 . ∈ ℕ
发表于 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
发表于 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
发表于 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
发表于 2025-3-30 03:42:19 | 显示全部楼层
发表于 2025-3-30 05:51:13 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 16:07
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表