找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: industrious
41#
發(fā)表于 2025-3-28 15:57:28 | 只看該作者
42#
發(fā)表于 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
43#
發(fā)表于 2025-3-28 23:50:03 | 只看該作者
44#
發(fā)表于 2025-3-29 06:14:20 | 只看該作者
45#
發(fā)表于 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 .?∈??
46#
發(fā)表于 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
47#
發(fā)表于 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
48#
發(fā)表于 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
49#
發(fā)表于 2025-3-30 03:42:19 | 只看該作者
50#
發(fā)表于 2025-3-30 05:51:13 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-23 23:46
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
含山县| 平顶山市| 永丰县| 石阡县| 瑞昌市| 龙南县| 鄄城县| 洞头县| 许昌市| 铜陵市| 芮城县| 大田县| 曲周县| 彰化县| 湄潭县| 衡水市| 成都市| 郎溪县| 大化| 达州市| 鄂托克旗| 渑池县| 安泽县| 三台县| 琼中| 南京市| 中宁县| 乐清市| 平安县| 清流县| 罗田县| 瑞丽市| 邮箱| 阿拉善左旗| 武威市| 成安县| 满城县| 东宁县| 长沙市| 田东县| 韶山市|