![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Maud Göthe-Lundgren
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j12]Joen Dahlberg
, Stefan Engevall, Maud Göthe-Lundgren, Kurt Jörnsten, Mikael Rönnqvist
:
Incitements for transportation collaboration by cost allocation. Central Eur. J. Oper. Res. 27(4): 1009-1032 (2019) - 2018
- [j11]Joen Dahlberg, Stefan Engevall, Maud Göthe-Lundgren:
Consolidation in Urban Freight Transportation - Cost Allocation Models. Asia Pac. J. Oper. Res. 35(4): 1850023:1-1850023:23 (2018) - 2017
- [j10]Joen Dahlberg
, Maud Göthe-Lundgren, Stefan Engevall
:
A note on the nonuniqueness of the Equal Profit Method. Appl. Math. Comput. 308: 84-89 (2017) - 2010
- [j9]Mikael Frisk, Maud Göthe-Lundgren, Kurt Jörnsten, Mikael Rönnqvist
:
Cost allocation in collaborative forest transportation. Eur. J. Oper. Res. 205(2): 448-458 (2010)
2000 – 2009
- 2006
- [j8]Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson
:
A stabilized column generation scheme for the traveling salesman subtour problem. Discret. Appl. Math. 154(15): 2212-2238 (2006) - [j7]Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson
:
A note on relatives to the Held and Karp 1-tree problem. Oper. Res. Lett. 34(3): 275-282 (2006) - 2005
- [j6]Jan A. Persson
, Maud Göthe-Lundgren:
Shipment planning at oil refineries using column generation and valid inequalities. Eur. J. Oper. Res. 163(3): 631-652 (2005) - 2004
- [j5]Stefan Engevall, Maud Göthe-Lundgren, Peter Värbrand:
The Heterogeneous Vehicle - Routing Game. Transp. Sci. 38(1): 71-85 (2004) - 2002
- [c2]Nima Golbaharan, Per Olov Lindberg, Maud Göthe-Lundgren:
Optimal Routing of Snowplows-A Column Generation Approach. OR 2002: 199-204
1990 – 1999
- 1998
- [j4]Stefan Engevall, Maud Göthe-Lundgren, Peter Värbrand:
The traveling salesman game: An application ofcost allocation in a gas and oil company. Ann. Oper. Res. 82: 203-218 (1998) - [j3]Stefan Engevall, Maud Göthe-Lundgren, Peter Värbrand:
A strong lower bound for the Node Weighted Steiner Tree Problem. Networks 31(1): 11-17 (1998) - 1997
- [c1]Patrick Lambrix
, Maud Göthe-Lundgren, Mariam Kamkar:
Computer science as an integrated part of engineering education (poster). ITiCSE-WGR 1997: 151 - 1996
- [j2]Maud Göthe-Lundgren, Kurt Jörnsten, Peter Värbrand:
On the nucleolus of the basic vehicle routing game. Math. Program. 72: 83-100 (1996) - 1994
- [j1]Maud Göthe-Lundgren, Torbjörn Larsson
:
A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem. Discret. Appl. Math. 48(3): 245-259 (1994)
Coauthor Index
![](https://dblp.uni-trier.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-04-26 18:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint