default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 264
Volume 264, July 2019
- Andrej Brodnik, Silvano Martello:
Combinatorial Optimization: Between Practice and Theory. 1-3 - Davi Castro-Silva
, Eric Gourdin:
A study on load-balanced variants of the bin packing problem. 4-14 - Zhou Chen, Yukun Cheng, Xiaotie Deng, Qi Qi, Xiang Yan:
Agent incentives of strategic behavior in resource exchange. 15-25 - Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
On approximating the Incremental Knapsack Problem. 26-42 - Dominik Goeke, Timo Gschwind, Michael Schneider:
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier. 43-61 - Sai Ji, Dachuan Xu, Donglei Du, Chenchen Wu:
Approximation algorithms for the fault-tolerant facility location problem with penalties. 62-75 - Imed Kacem, Hans Kellerer:
Complexity results for common due date scheduling problems with interval data and minmax regret criterion. 76-89 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural parameters, tight bounds, and approximation for (k, r)-center. 90-117 - Fengwei Li, Xiaoyan Zhang, Hajo Broersma:
A polynomial algorithm for weighted scattering number in interval graphs. 118-124 - Shasha Li, Yongtang Shi, Jianhua Tu, Yan Zhao:
On the complexity of k-rainbow cycle colouring problems. 125-133 - Xiyu Li, Alena Otto, Erwin Pesch:
Solving the single crane scheduling problem at rail transshipment yards. 134-147 - Lili Mei, Minming Li, Deshi Ye, Guochuan Zhang:
Facility location games with distinct desires. 148-160 - Dongmei Peng, Xiumei Wang:
Ear decomposition and induced even cycles. 161-166 - Rafal Rózycki, Grzegorz Waligóra:
On a certain class of power- and energy-related scheduling problems. 167-187 - Erfang Shan, Jing Zhao, Liying Kang:
Maximally connected p-partite uniform hypergraphs. 188-195 - Sándor Szabó, Bogdán Zaválnij:
Reducing hypergraph coloring to clique search. 196-207 - Yicheng Xu, Dachuan Xu, Donglei Du, Dongmei Zhang:
Approximation algorithm for squared metric facility location problem with nonuniform capacities. 208-217
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-28 00:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
