Dissecting a square into rectangles of equal area. - Roland Häggkvist; Per Olov Lindberg; B. Lindström (Discret. Math., 1983)

On the length of simplex paths: The assignment case. - Per Olov Lindberg; Snjólfur Ólafsson (Math. Program., 1984)

Additively decomposed quasiconvex functions. - Jean-Pierre Crouzeix; Per Olov Lindberg (Math. Program., 1986)

Computing global minima to polynomial optimization problems using Gröbner bases. - K. Hägglöf; Per Olov Lindberg; Lars Svensson (J. Glob. Optim., 1995)

A descent proximal level bundle method for convex nondifferentiable optimization. - Ulf Brännlund; Krzysztof C. Kiwiel; Per Olov Lindberg (Oper. Res. Lett., 1995)

TCP position tolerances in joint torque minimizations. - Sten Grahn; Patrik Flisberg; Gert Johansson; Per Olov Lindberg; Torbjörn Larsson (IROS, 1998)

Railway Timetabling Using Lagrangian Relaxation. - Ulf Brännlund; Per Olov Lindberg; Andreas Nõu; Jan-Eric Nilsson (Transp. Sci., 1998)

The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization. - Krzysztof C. Kiwiel; Torbjörn Larsson; Per Olov Lindberg (Math. Oper. Res., 1999)

Bregman Proximal Relaxation of Large-Scale 0-1 Problems. - Krzysztof C. Kiwiel; Per Olov Lindberg; Andreas Nõu (Comput. Optim. Appl., 2000)

A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment Problem. - Maria Daneva; Per Olov Lindberg (OR, 2002)

Multi-Class User Equilibria under Social Marginal Cost Pricing. - Leonid Engelson; Per Olov Lindberg; Maria Daneva (OR, 2002)

Optimal Routing of Snowplows-A Column Generation Approach. - Nima Golbaharan; Per Olov Lindberg; Maud Göthe-Lundgren (OR, 2002)

A Riccati-based primal interior point solver for multistage stochastic programming. - Jörgen Blomvall; Per Olov Lindberg (Eur. J. Oper. Res., 2002)

A Riccati-based primal interior point solver for multistage stochastic programming - extensions. - Jörgen Blomvall; Per Olov Lindberg (Optim. Methods Softw., 2002)

Some convexifications in global optimization of problems containing signomial terms. - Kaj-Mikael Björk; Per Olov Lindberg; Tapio Westerlund (Comput. Chem. Eng., 2003)

The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing. - Per Olov Lindberg; Gholamreza Razmara (OR, 2004)

Lagrangian Relaxation via Ballstep Subgradient Methods. - Krzysztof C. Kiwiel; Torbjörn Larsson; Per Olov Lindberg (Math. Oper. Res., 2007)

Gröbner Bases for Polynomial Equations. - Per Olov Lindberg; Lars Svensson (Encyclopedia of Optimization, 2009)

The Stiff Is Moving - Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment. - Maria Mitradjieva; Per Olov Lindberg (Transp. Sci., 2013)

Upright Stiff: subproblem updating in the FW method for traffic assignment. - Johan Holmgren; Per Olov Lindberg (EURO J. Transp. Logist., 2014)

Tolled multi-class traffic equilibria and toll sensitivities. - Per Olov Lindberg; Leonid Engelson (EURO J. Transp. Logist., 2015)

A disaggregate bundle method for train timetabling problems. - Abderrahman Ait-Ali; Per Olov Lindberg; Jonas Eliasson; Jan-Eric Nilsson; Anders Peterson (J. Rail Transp. Plan. Manag., 2020)

A canon of probabilistic rationality. - Simone Cerreia-Vioglio; Per Olov Lindberg; Fabio Maccheroni; Massimo Marinacci; Aldo Rustichini (J. Econ. Theory, 2021)

Railway timetabling for the future? A pilot study on a single track line. - Jan-Eric Nilsson; Per Olov Lindberg; Christina Gallner; Disa Asplund (J. Rail Transp. Plan. Manag., 2023)