default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPer Olov Lindberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Jan-Eric Nilsson
, Per Olov Lindberg, Christina Gallner, Disa Asplund:
Railway timetabling for the future? A pilot study on a single track line. J. Rail Transp. Plan. Manag. 27: 100402 (2023)- 2021
- [j17]Simone Cerreia-Vioglio, Per Olov Lindberg, Fabio Maccheroni, Massimo Marinacci, Aldo Rustichini:
A canon of probabilistic rationality. J. Econ. Theory 196: 105289 (2021) - 2020
- [j16]Abderrahman Ait-Ali, Per Olov Lindberg, Jonas Eliasson, Jan-Eric Nilsson, Anders Peterson:
A disaggregate bundle method for train timetabling problems. J. Rail Transp. Plan. Manag. 16: 100200 (2020)
2010 – 2019
- 2015
- [j15]Per Olov Lindberg, Leonid Engelson:
Tolled multi-class traffic equilibria and toll sensitivities. EURO J. Transp. Logist. 4(2): 197-222 (2015) - 2014
- [j14]Johan Holmgren, Per Olov Lindberg:
Upright Stiff: subproblem updating in the FW method for traffic assignment. EURO J. Transp. Logist. 3(3-4): 205-225 (2014) - 2013
- [j13]Maria Mitradjieva, Per Olov Lindberg:
The Stiff Is Moving - Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment. Transp. Sci. 47(2): 280-293 (2013)
2000 – 2009
- 2009
- [r1]Per Olov Lindberg, Lars Svensson:
Gröbner Bases for Polynomial Equations. Encyclopedia of Optimization 2009: 1469-1471 - 2007
- [j12]Krzysztof C. Kiwiel, Torbjörn Larsson, Per Olov Lindberg:
Lagrangian Relaxation via Ballstep Subgradient Methods. Math. Oper. Res. 32(3): 669-686 (2007) - 2004
- [c5]Per Olov Lindberg, Gholamreza Razmara:
The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing. OR 2004: 360-367 - 2003
- [j11]Kaj-Mikael Björk, Per Olov Lindberg, Tapio Westerlund:
Some convexifications in global optimization of problems containing signomial terms. Comput. Chem. Eng. 27(5): 669-679 (2003) - 2002
- [j10]Jörgen Blomvall, Per Olov Lindberg:
A Riccati-based primal interior point solver for multistage stochastic programming. Eur. J. Oper. Res. 143(2): 452-461 (2002) - [j9]Jörgen Blomvall, Per Olov Lindberg:
A Riccati-based primal interior point solver for multistage stochastic programming - extensions. Optim. Methods Softw. 17(3): 383-407 (2002) - [c4]Maria Daneva, Per Olov Lindberg:
A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment Problem. OR 2002: 133-138 - [c3]Leonid Engelson, Per Olov Lindberg, Maria Daneva:
Multi-Class User Equilibria under Social Marginal Cost Pricing. OR 2002: 174-179 - [c2]Nima Golbaharan, Per Olov Lindberg, Maud Göthe-Lundgren:
Optimal Routing of Snowplows-A Column Generation Approach. OR 2002: 199-204 - 2000
- [j8]Krzysztof C. Kiwiel, Per Olov Lindberg, Andreas Nõu:
Bregman Proximal Relaxation of Large-Scale 0-1 Problems. Comput. Optim. Appl. 15(1): 33-44 (2000)
1990 – 1999
- 1999
- [j7]Krzysztof C. Kiwiel, Torbjörn Larsson, Per Olov Lindberg:
The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization. Math. Oper. Res. 24(1): 237-254 (1999) - 1998
- [j6]Ulf Brännlund, Per Olov Lindberg, Andreas Nõu, Jan-Eric Nilsson:
Railway Timetabling Using Lagrangian Relaxation. Transp. Sci. 32(4): 358-369 (1998) - [c1]Sten Grahn, Patrik Flisberg, Gert Johansson, Per Olov Lindberg, Torbjörn Larsson:
TCP position tolerances in joint torque minimizations. IROS 1998: 800-805 - 1995
- [j5]K. Hägglöf, Per Olov Lindberg, Lars Svensson:
Computing global minima to polynomial optimization problems using Gröbner bases. J. Glob. Optim. 7(2): 115-125 (1995) - [j4]Ulf Brännlund, Krzysztof C. Kiwiel, Per Olov Lindberg:
A descent proximal level bundle method for convex nondifferentiable optimization. Oper. Res. Lett. 17(3): 121-126 (1995)
1980 – 1989
- 1986
- [j3]Jean-Pierre Crouzeix, Per Olov Lindberg:
Additively decomposed quasiconvex functions. Math. Program. 35(1): 42-57 (1986) - 1984
- [j2]Per Olov Lindberg, Snjólfur Ólafsson:
On the length of simplex paths: The assignment case. Math. Program. 30(3): 243-260 (1984) - 1983
- [j1]Roland Häggkvist, Per Olov Lindberg, B. Lindström:
Dissecting a square into rectangles of equal area. Discret. Math. 47: 321-323 (1983)
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-04-24 22:58 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:
