Approximation algorithmsLP-roundingWe consider a multistage framework introduced recently (Eisenstat et al., Gupta et al., both in ICALP 2014), where given a time horizon t = 1,2, ...,T, the input is a sequence of instances of a (static) combinatorial optimization problem I1, I2,......
We present both randomized and deterministic LP based algorithms, and show both theoretically and computationally their usefulness for large-scale problems.doi:10.1007/s10479-006-0048-1Geir DahlCentre of Mathematics for Applications and Department of InformaticsNjal Foldnes...
Ramon Alvarez-Valdes;Antonio Parajon;and Jose M Tamarit.A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems.OR Spectrum.2002.179-192Ramon Alvarez-Valdes,Antonio Parajon,Jose M. Tamarit.A computational study of LP-based heuristic algorithms for ...
All mathematical formulations and algorithms were implemented in GAMS (Brooke et al., 2005) 22.2. The resulting LPs were solved with CPLEX while the NLPs were solved by MINOS, CONOPT and BARON to Optimal water-using networks In this section we present most of the global optimal water-using ...
Historically, for reasons of computing time, so-called “floating cone” methods (see [3] for example) have been used as heuristic and exact alternatives to the Lerchs–Grossman algorithm, although computing time is not an issue today for these algorithms. A dynamic programming approach to the...
traveling salesperson problemNP-hardWe provide approximation algorithms for some capacitated vehicle routing and delivery problems. These problems can all be ... P Chalasani,R Motwani - 《Siam Journal on Computing》...
会议名称: Tenth Acm-siam Symposium on Discrete Algorithms 会议时间: 1999/01/01 主办单位: ACM 被引量: 38 收藏 引用 批量引用 报错 分享 全部来源 求助全文 AMS ResearchGate zentralblatt-math.org 相似文献 参考文献 引证文献LP-based analysis of greedy-dual size (extended abstract) The authors give ...
which only loses a small fraction in the approximation guar-antee.We apply our technique to derive approximation algorithms for MCPC.To this aim, we develop an LP-based12 (1−1e )-approximation algorithmfor MCPK by adapting the pipage rounding technique. Combined withour reduction technique, ...
Uses both access methods: libusb and the usblp kernel module Discovers always all printers independent which ones are attached to the kernel module and which ones has to get accessed directly through libusb Algorithms to generate the make and model part of the URIs are identical now for both ...
LP-relaxation based distributed algorithms for scheduling in wireless networks LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central ro... C Singh,A Nedic,R Srikant - IEEE Infocom-ieee Conference ...