default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Engau
Person information
- affiliation: Dalhousie University, Halifax, NS, Canada
- affiliation (former): Clemson University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b1]Alexander Engau:
Beyond Pareto optimality: domination and decomposition in multiobjective programming. Clemson University, 2008, ISBN 978-3-8364-5713-2, pp. 1-230
Journal Articles
- 2024
- [j15]Ibrahim O. Oguntola
, M. Ali Ülkü, Ahmed Saif, Alexander Engau:
On the value of shipment consolidation and machine learning techniques for the optimal design of a multimodal logistics network. INFOR Inf. Syst. Oper. Res. 62(1): 1-52 (2024) - 2022
- [j14]Matthias Ehrgott, Alexander Engau, Margaret M. Wiecek:
Theory, computation, and practice of multiobjective optimisation. Ann. Oper. Res. 319(2): 1477-1478 (2022) - 2020
- [j13]Alexander Engau, Devon Sigler:
Pareto solutions in multicriteria optimization under uncertainty. Eur. J. Oper. Res. 281(2): 357-368 (2020) - 2017
- [j12]Alexander Engau:
Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization. Math. Oper. Res. 42(1): 119-134 (2017) - 2015
- [j11]Alexander Engau:
Definition and Characterization of Geoffrion Proper Efficiency for Real Vector Optimization with Infinitely Many Criteria. J. Optim. Theory Appl. 165(2): 439-457 (2015) - 2014
- [j10]Alexander Engau:
Some Experiences with Solving Semidefinite Programming Relaxations of Binary quadratic Optimization Models in Computational Biology. Asia Pac. J. Oper. Res. 31(4) (2014) - 2013
- [j9]Alexander Engau, Miguel F. Anjos, Immanuel M. Bomze:
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem. Math. Methods Oper. Res. 78(1): 35-59 (2013) - 2012
- [j8]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems. Optim. Methods Softw. 27(3): 539-559 (2012) - 2010
- [j7]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization. Electron. Notes Discret. Math. 36: 743-750 (2010) - [j6]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
On Interior-Point Warmstarts for Linear and Combinatorial Optimization. SIAM J. Optim. 20(4): 1828-1861 (2010) - 2009
- [j5]Alexander Engau:
Tradeoff-based decomposition and decision-making in multiobjective programming. Eur. J. Oper. Res. 199(3): 883-891 (2009) - 2008
- [j4]Alexander Engau:
Variable preference modeling with ideal-symmetric convex cones. J. Glob. Optim. 42(2): 295-311 (2008) - [j3]Alexander Engau, Margaret M. Wiecek:
Interactive Coordination of Objective Decompositions in Multiobjective Programming. Manag. Sci. 54(7): 1350-1363 (2008) - 2007
- [j2]Alexander Engau, Margaret M. Wiecek:
Generating epsilon-efficient solutions in multiobjective programming. Eur. J. Oper. Res. 177(3): 1566-1579 (2007) - [j1]Alexander Engau, Margaret M. Wiecek:
Exact generation of epsilon-efficient solutions in multiple objective programming. OR Spectr. 29(2): 335-350 (2007)
Conference and Workshop Papers
- 2006
- [c1]Margaret M. Wiecek, Alexander Engau:
Promoting epsilon-Efficiency in Multiple Objective Programming: Theory, Methodology, and Application. OR 2006: 131
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-06-03 00:12 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:
