default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKameng Nip
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Kameng Nip, Peng Xie:
Computational complexity and algorithms for two scheduling problems under linear constraints. J. Comb. Optim. 47(4): 55 (2024)- 2023
- [j11]Kameng Nip
, Zhenbo Wang:
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints. J. Sched. 26(6): 543-558 (2023) - [c7]Kameng Nip:
On the NP-Hardness of Two Scheduling Problems Under Linear Constraints. IJTCS-FAW 2023: 58-70 - 2022
- [j10]Kameng Nip, Tianning Shi, Zhenbo Wang:
Some graph optimization problems with weights satisfying linear constraints. J. Comb. Optim. 43(1): 200-225 (2022) - [j9]Siyun Zhang, Kameng Nip, Zhenbo Wang:
Related machine scheduling with machine speeds satisfying linear constraints. J. Comb. Optim. 44(3): 1724-1740 (2022) - 2021
- [j8]Zeyang Wu, Kameng Nip, Qie He:
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints. INFORMS J. Comput. 33(3): 1197-1212 (2021)
2010 – 2019
- 2019
- [j7]Kameng Nip, Zhenbo Wang:
On the approximability of the two-phase knapsack problem. J. Comb. Optim. 38(4): 1155-1179 (2019) - [c6]Kameng Nip, Zhenbo Wang:
Two-Machine Flow Shop Scheduling Problem Under Linear Constraints. COCOA 2019: 400-411 - [c5]Kameng Nip, Zhenbo Wang, Tianning Shi:
Some Graph Optimization Problems with Weights Satisfying Linear Constraints. COCOA 2019: 412-424 - 2018
- [c4]Siyun Zhang, Kameng Nip, Zhenbo Wang:
Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints. COCOA 2018: 314-328 - [c3]Kameng Nip, Zhenbo Wang:
Approximation Algorithms for a Two-Phase Knapsack Problem. COCOON 2018: 63-75 - 2017
- [j6]Zhenbo Wang, Kameng Nip:
Bin packing under linear constraints. J. Comb. Optim. 34(4): 1198-1209 (2017) - [j5]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Knapsack with variable weights satisfying linear constraints. J. Glob. Optim. 69(3): 713-725 (2017) - [i4]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Assortment Optimization under a Single Transition Model. CoRR abs/1702.03700 (2017) - 2016
- [j4]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Scheduling under linear constraints. Eur. J. Oper. Res. 253(2): 290-297 (2016) - [j3]Kameng Nip, Zhenbo Wang, Wenxun Xing:
A study on several combination problems of classic shop scheduling and shortest path. Theor. Comput. Sci. 654: 175-187 (2016) - 2015
- [j2]Fabrice Talla Nobibon, Roel Leus, Kameng Nip, Zhenbo Wang:
Resource loading with time windows. Eur. J. Oper. Res. 244(2): 404-416 (2015) - [j1]Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus:
A combination of flow shop scheduling and the shortest path problem. J. Comb. Optim. 29(1): 36-52 (2015) - [c2]Kameng Nip, Zhenbo Wang, Wenxun Xing:
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. COCOON 2015: 97-108 - [i3]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Scheduling under Linear Constraints. CoRR abs/1510.08551 (2015) - 2013
- [c1]Kameng Nip, Zhenbo Wang:
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems. COCOON 2013: 680-687 - [i2]Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus:
A Combination of Flow Shop Scheduling and the Shortest Path Problem. CoRR abs/1309.0081 (2013) - [i1]Kameng Nip, Zhenbo Wang, Wenxun Xing:
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. CoRR abs/1309.0082 (2013)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-16 23:01 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
