Guangting Chen

From MaRDI portal
Revision as of 05:35, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:313818

Available identifiers

zbMath Open chen.guangtingMaRDI QIDQ313818

List of research outcomes





PublicationDate of PublicationType
Scheduling double-track gantry cranes to minimize the overall loading/unloading time2024-05-23Paper
An improved algorithm for parallel machine scheduling under additional resource constraints2023-03-24Paper
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints2023-01-04Paper
Approximation algorithms for the maximally balanced connected graph tripartition problem2022-10-04Paper
Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints2022-06-29Paper
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph2022-04-13Paper
https://portal.mardi4nfdi.de/entity/Q50160232021-12-10Paper
Improved hardness and approximation results for single allocation hub location2021-07-05Paper
An improved algorithm for a two-stage production scheduling problem with an outsourcing option2021-06-23Paper
Improved hardness and approximation results for single allocation hub location problems2021-04-08Paper
https://portal.mardi4nfdi.de/entity/Q51284592020-10-27Paper
Online scheduling with unit processing times and processing set restrictions2019-10-04Paper
The largest matching roots of unicyclic graphs with a fixed matching number2019-09-10Paper
On the largest matching roots of graphs with a given number of pendent vertices2019-02-20Paper
https://portal.mardi4nfdi.de/entity/Q46904592018-10-22Paper
On the 2-MRS problem in a tree with unreliable edges2018-10-10Paper
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph2018-10-04Paper
On the NP-hardness of scheduling with time restrictions2018-08-17Paper
Approximate the scheduling of quay cranes with non-crossing constraints2018-05-25Paper
Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks2018-02-26Paper
https://portal.mardi4nfdi.de/entity/Q52826672017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q29836312017-05-17Paper
Better permutations for the single-processor scheduling with time restrictions2017-04-20Paper
On the Meir-Keeler-Khan set contractions2016-10-24Paper
Scheduling jobs with equal processing times and a single server on parallel identical machines2016-09-12Paper
An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges2015-04-15Paper
https://portal.mardi4nfdi.de/entity/Q49808002014-06-30Paper
Relay node placement in two-tiered wireless sensor networks with base stations2013-12-02Paper
Approximation algorithms for parallel open shop scheduling2013-03-20Paper
https://portal.mardi4nfdi.de/entity/Q35384152008-11-24Paper
The web proxy location problem in general tree of rings networks2007-10-12Paper
A new least square algorithm for linear programming2006-10-04Paper
Combined projected gradient algorithm for linear programming2006-08-10Paper
https://portal.mardi4nfdi.de/entity/Q33727772006-03-10Paper
https://portal.mardi4nfdi.de/entity/Q48284932004-11-19Paper
Constrained Steiner trees in Halin graphs2004-06-10Paper
A PTAS for weight constrained Steiner trees in series--parallel graphs.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q45422252003-04-10Paper
https://portal.mardi4nfdi.de/entity/Q45513902002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q27646862002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q27682982002-03-24Paper
A constrained minimum spanning tree problem2001-05-02Paper
https://portal.mardi4nfdi.de/entity/Q42428471999-05-11Paper

Research outcomes over time

This page was built for person: Guangting Chen