![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Xiang Song 0001
Person information
- affiliation: University of Portsmouth, School of Mathematics and Physics, Portsmouth, UK
Other persons with the same name
- Xiang Song — disambiguation page
- Xiang Song 0002
(aka: Xiang (Ben) Song) — Massachusetts Institute of Technology, Cambridge, MA, USA
- Xiang Song 0003
— AWS AI, Santa Clara, CA, USA
- Xiang Song 0004
— Nanjing Xiaozhuang University, School of Electronic Engineering, Nanjing, China
- Xiang Song 0005
— Xi'an Jiaotong University, Xi'an, China
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Tsz Yu Suen, Xiang Song
, Dylan Jones:
A two-stage stochastic model for a multi-objective blood platelet supply chain network design problem incorporating frozen platelets. Comput. Ind. Eng. 185: 109651 (2023) - 2021
- [j16]Washington A. Oliveira
, Diego Jacinto Fiorotto, Xiang Song
, Dylan F. Jones
:
An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem. Eur. J. Oper. Res. 295(3): 996-1007 (2021) - 2020
- [j15]Xiang Song
, Dylan F. Jones
, Nasrin Asgari
, Tim Pigden:
Multi-objective vehicle routing and loading with time window constraints: a real-life application. Ann. Oper. Res. 291(1): 799-825 (2020)
2010 – 2019
- 2019
- [j14]Yan Chen
, Xiang Song
, Djamila Ouelhadj
, Yaodong Cui:
A heuristic for the skiving and cutting stock problem in paper and plastic film industries. Int. Trans. Oper. Res. 26(1): 157-179 (2019) - 2017
- [j13]Chandra Ade Irawan
, Xiang Song
, Dylan F. Jones
, Negar Akbari:
Layout optimisation for an installation port of an offshore wind farm. Eur. J. Oper. Res. 259(1): 67-83 (2017) - [j12]Yaodong Cui, Xiang Song
, Yan Chen
, Yi-Ping Cui:
New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers. J. Oper. Res. Soc. 68(3): 269-280 (2017) - 2016
- [j11]C. Zhang, Xiao Liu, YP. Jiang, B. Fan, Xiang Song
:
A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis. Eur. J. Oper. Res. 250(3): 855-864 (2016) - 2015
- [j10]Marta Cabo, Edgar Possani
, Chris N. Potts, Xiang Song
:
Split-merge: Using exponential neighborhood search for scheduling a batching machine. Comput. Oper. Res. 63: 125-135 (2015) - 2014
- [j9]Xiang Song
, Julia A. Bennell
:
Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem. J. Oper. Res. Soc. 65(7): 1037-1052 (2014) - [c1]Chengbin Chu, Eric E. Longomo, Xiang Song
, Djamila Ouelhadj
:
Flexibility analysis on a supply chain contract using a parametric Linear Programming model. CASE 2014: 704-709 - 2013
- [j8]Wei Han, Julia A. Bennell
, Xiaozhou Zhao, Xiang Song
:
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. Eur. J. Oper. Res. 230(3): 495-504 (2013) - 2012
- [j7]Xiang Song
, Rhyd Lewis
, Jonathan M. Thompson, Yue Wu:
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. Comput. Oper. Res. 39(9): 1988-2000 (2012) - 2011
- [j6]Rhyd Lewis
, Xiang Song
, Kathryn A. Dowsland, Jonathan M. Thompson:
An investigation into two bin packing problems with ordering and orientation implications. Eur. J. Oper. Res. 213(1): 52-65 (2011) - [j5]Jiabin Luo, Yue Wu, Árni Halldórsson, Xiang Song
:
Storage and stacking logistics problems in container terminals. OR Insight 24(4): 256-275 (2011) - 2010
- [j4]Xiang Song
, C. B. Chu, Rhyd Lewis
, Y. Y. Nie, Jonathan M. Thompson:
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. Eur. J. Oper. Res. 202(2): 368-378 (2010) - [j3]Julia A. Bennell
, Xiang Song
:
A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2): 167-188 (2010)
2000 – 2009
- 2008
- [j2]Julia A. Bennell
, Xiang Song
:
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35(1): 267-281 (2008) - 2006
- [j1]Xiang Song
, C. B. Chu, Y. Y. Nie, Julia A. Bennell
:
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem. Eur. J. Oper. Res. 175(3): 1870-1889 (2006)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-28 22:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint