Peter Värbrand
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Peter Värbrand has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Di Yuan
Linköping University
2 shared publications - Nikolaos Pappas
Linköping University, Linköping, Sweden
2 shared publications Di Yuan
Department of Science and Technology Linköping University Sweden
1 shared publication- Di Yuan
Department of Science and Technology (ITN) Linköping University Sweden
1 shared publication - Federico Malucelli
Politecnico di Milano
1 shared publication - Iana Siomina
Department of Science and Technology, Linköping University, SE-601 74 Norrköping, Sweden
1 shared publication
Latest Publications
- Open Access
Energy-Aware Wireless Relay Selection in Load-Coupled OFDMA Cellular Networks
We investigate transmission energy minimization via optimizing wireless relay selection in orthogonal-frequency-division multiple access (OFDMA) networks. We take into account the impact of the load of cells on transmission energy. We prove the NP-hardness of the energy-aware wireless relay selection problem. To tackle the computational complexity, a partial optimality condition is derived for providing insights in respect of designing an effective and efficient algorithm. Numerical results show that the resulting algorithm achieves high energy performance.
Open AccessEnergy-Aware Wireless Relay Selection in Load-Coupled OFDMA Cellular Networks
We investigate transmission energy minimization via optimizing wireless relay selection in orthogonal-frequency-division multiple access (OFDMA) networks. We take into account the impact of the load of cells on transmission energy. We prove the NP-hardness of the energy-aware wireless relay selection problem. To tackle the computational complexity, a partial optimality condition is derived for providing insights in respect of designing an effective and efficient algorithm. Numerical results show that the resulting algorithm achieves high energy performance.
- 6 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (1) , 144-147
Energy-Aware Wireless Relay Selection in Load-Coupled OFDMA Cellular Networks
We investigate transmission energy minimization via optimizing wireless relay selection in orthogonal-frequency-division multiple access networks. We take into account the impact of the load of cells on transmission energy. We prove the NP-hardness of the energy-aware wireless relay selection problem. To tackle computational complexity, a partial optimality condition is derived for providing insights in respect of designing an effective and efficient algorithm. Numerical results show the resulting algorithm achieves high energy performance.
- 6 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (1) , 144-147
Energy-Aware Wireless Relay Selection in Load-Coupled OFDMA Cellular Networks
We investigate transmission energy minimization via optimizing wireless relay selection in orthogonal-frequency-division multiple access networks. We take into account the impact of the load of cells on transmission energy. We prove the NP-hardness of the energy-aware wireless relay selection problem. To tackle computational complexity, a partial optimality condition is derived for providing insights in respect of designing an effective and efficient algorithm. Numerical results show the resulting algorithm achieves high energy performance.
- 1 May 2004
- Published by Springer Nature in Telecommunication Systems
- Vol. 26 (1) , 53-67
Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming
- 1 May 2004
- Published by Springer Nature in Telecommunication Systems
- Vol. 26 (1) , 53-67
Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming
- 27 August 2003
- Published by Wiley in International Transactions in Operational Research
- Vol. 10 (5) , 433-447
A solution approach for log truck scheduling based on composite pricing and branch and bound
The logging truck scheduling problem is one of the most complex routing problems where both pick‐up and delivery operations are included. It consists in finding one feasible route for each vehicle in order to satisfy the demands of the customers and in such a way that the total transport cost is minimized. We use a mathematical formulation of the log truck scheduling problem where each column represents a feasible route. We generate a large pool of columns based on solving a transportation problem. Then we apply a composite pricing algorithm, which mainly consists of pricing the pool of columns and maintain an active set of these, for solving the LP relaxed model. A branch and price approach is used to obtain integer solutions in which we apply composite pricing to generate new columns. Numerical results from case studies at Swedish forestry companies are presented.
- 27 August 2003
- Published by Wiley in International Transactions in Operational Research
- Vol. 10 (5) , 433-447
A solution approach for log truck scheduling based on composite pricing and branch and bound
The logging truck scheduling problem is one of the most complex routing problems where both pick‐up and delivery operations are included. It consists in finding one feasible route for each vehicle in order to satisfy the demands of the customers and in such a way that the total transport cost is minimized. We use a mathematical formulation of the log truck scheduling problem where each column represents a feasible route. We generate a large pool of columns based on solving a transportation problem. Then we apply a composite pricing algorithm, which mainly consists of pricing the pool of columns and maintain an active set of these, for solving the LP relaxed model. A branch and price approach is used to obtain integer solutions in which we apply composite pricing to generate new columns. Numerical results from case studies at Swedish forestry companies are presented.