default search action
Siriphong Lawphongpanich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j13]Michael Florian, Siriphong Lawphongpanich:
Pricing in transportation networks. EURO J. Transp. Logist. 4(2): 195-196 (2015) - 2011
- [j12]Di Wu, Yafeng Yin
, Siriphong Lawphongpanich:
Pareto-improving congestion pricing on multimodal transportation networks. Eur. J. Oper. Res. 210(3): 660-669 (2011) - 2010
- [j11]Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich:
A heuristic method for the minimum toll booth problem. J. Glob. Optim. 48(4): 533-548 (2010) - [j10]Younes Hamdouch, Siriphong Lawphongpanich:
Congestion Pricing for Schedule-Based Transit Networks. Transp. Sci. 44(3): 350-366 (2010)
2000 – 2009
- 2009
- [r3]Siriphong Lawphongpanich:
Convex-Simplex Algorithm. Encyclopedia of Optimization 2009: 558-561 - [r2]Siriphong Lawphongpanich:
Frank-Wolfe Algorithm. Encyclopedia of Optimization 2009: 1094-1097 - [r1]Siriphong Lawphongpanich:
Simplicial Decomposition. Encyclopedia of Optimization 2009: 3575-3579 - 2007
- [j9]Artyom G. Nahapetyan, Siriphong Lawphongpanich:
Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum. J. Glob. Optim. 38(1): 41-60 (2007) - 2006
- [j8]Siriphong Lawphongpanich:
Dynamic Slope Scaling Procedure and Lagrangian Relaxation with Subproblem Approximation. J. Glob. Optim. 35(1): 121-130 (2006) - 2004
- [j7]Siriphong Lawphongpanich, Donald W. Hearn:
An MPEC approach to second-best toll pricing. Math. Program. 101(1): 33-55 (2004) - [j6]Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich:
Decomposition techniques for the minimum toll revenue problem. Networks 44(2): 142-150 (2004) - 2002
- [j5]Siriphong Lawphongpanich:
A nontangential cutting plane algorithm. Oper. Res. Lett. 30(1): 49-56 (2002) - 2000
- [j4]K. J. Becker, Donald P. Gaver, Kevin D. Glazebrook, Patricia A. Jacobs, Siriphong Lawphongpanich:
Allocation of tasks to specialized processors: A planning approach. Eur. J. Oper. Res. 126(1): 80-88 (2000) - [j3]Siriphong Lawphongpanich:
Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints. Oper. Res. Lett. 26(1): 33-41 (2000)
1990 – 1999
- 1993
- [j2]Ding-Zhu Du, Siriphong Lawphongpanich:
Book reviews. J. Glob. Optim. 3(2): 257-259 (1993) - 1990
- [j1]Siriphong Lawphongpanich, Donald W. Hearn:
Benders Decomposition for Variational Inequalities. Math. Program. 48: 231-247 (1990)
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-10-07 21:19 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: