Peter Värbrand - Citegraph

Author Info

Name	Affiliation	Papers
PETER VÄRBRAND	Department of Mathematics Linköping Institute of Technology S-581 83 Linköping Sweden	18
Collaborators	Citations	PageRank
24	247	22.37
Referers	Referees	References
495	215	146

Search Limit

100495

Publications (18 rows)

Collaborators (24 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Energy-Aware Wireless Relay Selection in Load-Coupled OFDMA Cellular Networks.	0	0.34	2017
On Power Minimization for Non-orthogonal Multiple Access (NOMA).	2	0.38	2016
Scheduling de-icing vehicles within airport logistics: a heuristic algorithm and performance evaluation.	6	0.83	2012
The Integrated Dial-a-Ride Problem	13	0.88	2009
A dynamic programming method for optimal scheduling in high speed downlink packet access	1	0.36	2006
Optimized planning of frequency hopping in cellular networks	3	0.54	2005
Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming	0	0.34	2004
The Heterogeneous Vehicle-Routing Game	24	1.25	2004
A column generation method for spatial TDMA scheduling in ad hoc networks	53	2.52	2004
Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach	23	1.77	2003
Ring Network Design by Lagrangean Based Column Generation.	1	0.36	2002
The traveling salesman game: An application ofcost allocation in a gas and oil company	13	0.87	1998
A strong lower bound for the Node Weighted Steiner Tree Problem.	12	1.03	1998
On the nucleolus of the basic vehicle routing game	35	4.96	1996
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables	16	1.13	1996
The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs	8	0.70	1995
A quasiconcave minimization method for solving linear two-level programs	10	0.97	1994
A global optimization approach for the linear two-level program	27	3.13	1993

1