default search action
Todd Easton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Todd Easton, Jennifer Tryon, Fabio Vitor
:
Two-set inequalities for the binary knapsack polyhedra. Discret. Optim. 54: 100859 (2024) - 2022
- [j14]Fabio Vitor
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming. Comput. Optim. Appl. 83(1): 211-246 (2022)
2010 – 2019
- 2018
- [j13]Fabio Vitor
The double pivot simplex method. Math. Methods Oper. Res. 87(1): 109-137 (2018) - 2017
- [c3]Lucas Verschelden, Jessica L. Heier Stamm
Integrated optimization and simulation models for the locomotive refueling system configuration problem. WSC 2017: 3382-3393 - 2015
- [j12]Todd Easton
Optimizing quarantine regions through ellipsoidal geographic networks. Comput. Ind. Eng. 80: 145-153 (2015) - [j11]Luke Muggy, Todd Easton
Generating class schedules within a complex modular environment with application to secondary schools. J. Sched. 18(4): 369-376 (2015) - 2012
- [j10]Mark D. Hopkins, Anil Pahwa, Todd Easton
Intelligent Dispatch for Distributed Renewable Resources. IEEE Trans. Smart Grid 3(2): 1047-1054 (2012) - 2011
- [j9]Todd Easton, Kyle Carlyle, Joseph Anderson, Matthew R. James:
Simulating the Spread of an Epidemic in a Small Rural Kansas Town. Int. J. Artif. Life Res. 2(2): 95-104 (2011) - [p1]David Ben-Arieh, Todd Easton
Product Design Compromise Using Consensus Models. Consensual Processes 2011: 405-423
2000 – 2009
- 2009
- [j8]David Ben-Arieh, Todd Easton
Minimum Cost Consensus With Quadratic Cost Functions. IEEE Trans. Syst. Man Cybern. Part A 39(1): 210-217 (2009) - 2008
- [j7]Todd Easton
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes. Discret. Optim. 5(2): 254-261 (2008) - [j6]Todd Easton
A large neighborhood search heuristic for the longest common subsequence problem. J. Heuristics 14(3): 271-283 (2008) - 2007
- [j5]David Ben-Arieh, Todd Easton
Multi-criteria group consensus under linear cost opinion elasticity. Decis. Support Syst. 43(3): 713-721 (2007) - [c2]Phillip Schumm, Caterina M. Scoglio
Epidemic Spreading on Weighted Contact Networks. BIONETICS 2007: 201-208 - [c1]Mina Kamel, Caterina M. Scoglio
Optimal Topology Design for Overlay Networks. Networking 2007: 714-725 - 2006
- [j4]Eva K. Lee, Todd Easton
Novel evolutionary models and applications to sequence alignment problems. Ann. Oper. Res. 148(1): 167-187 (2006) - 2003
- [j3]Todd Easton
Facets of the independent set polytope. Math. Program. 98(1-3): 177-199 (2003) - [j2]Steven B. Horton, Todd Easton
The linear arrangement problem on recursively constructed graphs. Networks 42(3): 165-168 (2003) - 2001
- [j1]Todd Easton
On completing latin squares. Discret. Appl. Math. 113(2-3): 167-181 (2001)
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-23 21:23 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: