default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandro Pirkwieser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c8]Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl:
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. EvoCOP 2012: 13-24- 2011
- [c7]Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb
:
Improved Packing and Routing of Vehicles with Compartments. EUROCAST (1) 2011: 392-399 - [c6]Andreas M. Chwatal, Sandro Pirkwieser:
Solving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search. EUROCAST (1) 2011: 456-463 - 2010
- [c5]Sandro Pirkwieser, Günther R. Raidl:
Multilevel Variable Neighborhood Search for Periodic Routing Problems. EvoCOP 2010: 226-238 - [c4]Sandro Pirkwieser, Günther R. Raidl:
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. Hybrid Metaheuristics 2010: 174-189 - [p2]Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser:
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. Matheuristics 2010: 71-102
2000 – 2009
- 2009
- [c3]Sandro Pirkwieser, Günther R. Raidl:
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. Hybrid Metaheuristics 2009: 45-59 - 2008
- [c2]Sandro Pirkwieser, Günther R. Raidl:
Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. GECCO 2008: 323-330 - [p1]Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 69-85 - 2007
- [c1]Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. EvoCOP 2007: 176-187
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-04-24 23:05 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:
