找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Operations Research Proceedings 2015; Selected Papers of t Karl Franz D?rner,Ivana Ljubic,Gernot Tragler Conference proceedings 2017 Spring

[復(fù)制鏈接]
樓主: 烏鴉
41#
發(fā)表于 2025-3-28 18:29:44 | 只看該作者
Robust Two-Stage Network Problemsarc costs are precisely known, and completed optimally in the second stage, after a true second-stage cost scenario occurs. The robust min-max criterion is used to compute an optimal solution. Several complexity results for the interval and discrete uncertainty representations are provided.
42#
發(fā)表于 2025-3-28 20:46:19 | 只看該作者
Composed Min-Max and Min-Sum Radial Approach to the Emergency System Designhe worst situated user must be considered. Optimization of the average user disutility is often related to the weighted .-median problem. To cope with both objectives, we have suggested a composed method. In the first phase, the disutility of the worst situated user is minimized. The second phase is
43#
發(fā)表于 2025-3-29 01:40:32 | 只看該作者
LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gapformulation, different (small) item lengths and corresponding availabilities are given. We aim at maximizing the number of objects with a certain minimum length that can be constructed by connecting the items on hand. Such computations are of high interest in many real world application, e.g. in ind
44#
發(fā)表于 2025-3-29 05:37:39 | 只看該作者
Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Probletrip Packing Problem. The idea of this new approach is to optimise the width and the height of all items aiming to find an instance with maximal performance ratio with respect to the considered heuristic. Therefore, we model the pattern obtained by the heuristic as a solution of an ILP problem and m
45#
發(fā)表于 2025-3-29 07:19:12 | 只看該作者
46#
發(fā)表于 2025-3-29 13:42:45 | 只看該作者
47#
發(fā)表于 2025-3-29 16:13:33 | 只看該作者
Computing Partitions with Applications to Capital Budgeting Problemst ., ., has a return of . and a price of .. Further for every portfolio . there is capacity .. The task is to choose . disjoint portfolios . from . such that for every . the prices in . do not exceed the capacity . and the total return of this selection is maximized. From a computational point of vi
48#
發(fā)表于 2025-3-29 21:37:07 | 只看該作者
49#
發(fā)表于 2025-3-30 00:11:02 | 只看該作者
The Onset of Congestion in Charging of Electric Vehicles for Proportionally Fair Network Management tly. Such development suggests that a congestion management protocol will be a crucial component of future technological innovations in low voltage networks. An important property of a suitable network capacity management protocol is to balance network efficiency and fairness requirements. Assuming
50#
發(fā)表于 2025-3-30 04:45:00 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(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ī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 09:10
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
铜陵市| 隆回县| 建平县| 波密县| 和硕县| 南昌县| 和政县| 锦屏县| 咸阳市| 晋江市| 谢通门县| 龙江县| 吉木乃县| 上饶市| 米泉市| 灵石县| 越西县| 武乡县| 潮安县| 河间市| 顺昌县| 德格县| 历史| 全椒县| 双桥区| 汉中市| 库伦旗| 子长县| 泸定县| 巩留县| 耿马| 阿拉善盟| 常宁市| 靖远县| 博野县| 青冈县| 定南县| 大渡口区| 南阳市| 新乡县| 沅陵县|