On the Branch and Cut Method for Multidimentional Mixed Integer Knapsack Problem

Khorramizadeh, Mostafa; Rakhshandehroo, Zahra

doi:10.14419/ijamr.v3i4.3378

Cited by 4 publications

(1 citation statement)

References 6 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we consider the branch and cut plane method (exact algorithm) to solve this mixed integer programming problem. Te branch cut plane method is often used to solve mixed integer programming problems [51]. Te optimization goal is sought by solving a series of prior relaxation problems of integer programming problems.…”

Section: Solution Algorithmmentioning

confidence: 99%

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Xiao

Wang

2022

Journal of Advanced Transportation

View full text Add to dashboard Cite

The contradiction between the dramatic increase in the aggregate number of automobiles and the short supply of parking spaces leads to parking difficulties. Sharing mode helps improve the efficiency of existing parking spaces, increase resource utilization, and alleviate the difficulty of parking. This paper focuses on the matching mechanism in the shared parking slots problem, which involves three agents: shared parking suppliers, shared parking demanders, and shared parking platform. We propose a prospect theory-based two-sided satisfied and stable matching model (PT-TSSM) with two objectives to maximize the satisfaction degree of both shared parking demanders and shared parking suppliers. Numerical experiments are illustrated to demonstrate the efficiency of the proposed model. Moreover, the PT-TSSM model is compared with the other two shared parking mechanisms. The proposed model considers the satisfaction degrees of both shared parking demanders and suppliers, while first book first serve (FBFS) cares only one side of the participants. And compared with deferred acceptance (DA), our model not only takes two-sided stable matching into account but also considers the satisfaction degree of all the demand and supply participants, which obtain a two-sided satisfied and stable matching scheme.

show abstract

Section: Solution Algorithmmentioning

confidence: 99%

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Xiao

Wang

2022

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

QoE-based routing algorithms for H.264/SVC video over ad-hoc networks

et al. 2015

View full text Add to dashboard Cite

Q-RoSA: QoE-aware routing for SVC video streaming over ad-hoc networks

Quang¹,

Piamrat²,

Singh³

et al. 2016

2016 13th IEEE Annual Consumer Communications &Amp; Networking Conference (CCNC)

View full text Add to dashboard Cite

International audienceRelaying packets through multi-hop ad-hoc networks and the scarcity of wireless resources can severely deteriorate the quality of service. As a result, one of the major challenges in video streaming over ad-hoc networks is enhancing users experience and network utilization. An extension of H.264 standard, named scalable video coding (SVC), enables smooth adaptation of video quality to networks' status. In this paper, we formulate the problem of optimizing quality of experience (QoE) for SVC under time-constraints. The problem itself is a mixed integer linear programming which is NP-hard, and therefore we propose a heuristic algorithm to solve it. Simulation results show that the proposed algorithm can provide the similar video quality as optimal solutions with shorter calculation time

show abstract

On the Branch and Cut Method for Multidimentional Mixed Integer Knapsack Problem

Cited by 4 publications

References 6 publications

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

QoE-based routing algorithms for H.264/SVC video over ad-hoc networks

Q-RoSA: QoE-aware routing for SVC video streaming over ad-hoc networks

Contact Info

Product

Resources

About