Algorithm for a least-distance programming problem

1974 ◽  
pp. 190-205 ◽  
Author(s):  
Philip Wolfe
Keyword(s):  
Programming Problem

An Iterated Greedy Algorithm for the Binary Quadratic Programming Problem

2010 ◽  
Vol 130 (6) ◽  
pp. 1089-1090
Author(s):  
Takenori Murakami ◽  
Fubito Toyama ◽  
Kenji Shoji ◽  
Jyuichi Miyamichi
Keyword(s):  
Quadratic Programming ◽  
Programming Problem ◽  
Greedy Algorithm ◽  
Quadratic Programming Problem ◽  
Binary Quadratic Programming ◽  
Iterated Greedy Algorithm ◽  
Iterated Greedy

On Solution of a Certain Integer Programming Problem of a Specific Form

1998 ◽  
Vol 30 (4-5) ◽  
pp. 115-120
Author(s):  
Ivan V. Sergienko ◽  
V. A. Roshchin
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Specific Form ◽  
Integer Programming Problem

Fuzzy Linear Programming Problem : Discussion And Application

2017 ◽  
pp. 109
Author(s):  
نورا علي عزيز
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Linear Programming

scholarly journals Analysis of Nonlinear Bypass Route Computation for Wired and Wireless Network Cooperation Recovery System

2018 ◽  
Vol 2 (3) ◽  
pp. 28 ◽  
Author(s):  
Yu Nakayama ◽  
Kazuki Maruta
Keyword(s):  
Programming Problem ◽  
Wireless Network ◽  
Resource Sharing ◽  
Computation Method ◽  
Integer Programming Problem ◽  
Binary Integer Programming ◽  
Telecommunication Services ◽  
Network Cooperation ◽  
Wireless Links ◽  
Routing Method

It is a significant issue for network carriers to immediately restore telecommunication services when a disaster occurs. A wired and wireless network cooperation (NeCo) system was proposed to address this problem. The goal of the NeCo system is quick and high-throughput recovery of telecommunication services in the disaster area using single-hop wireless links backhauled by wired networks. It establishes wireless bypass routes between widely deployed leaf nodes to relay packets to and from dead nodes whose normal wired communication channels are disrupted. In the previous study, the optimal routes for wireless links were calculated to maximize the expected physical layer throughput by solving a binary integer programming problem. However, the routing method did not consider throughput reduction caused by sharing of wireless resources among dead nodes. Therefore, this paper proposes a nonlinear bypass route computation method considering the wireless resource sharing among dead nodes for the NeCo system. Monte Carlo base approach is applied since the nonlinear programming problem is difficult to solve. The performance of the proposed routing method is evaluated with computer simulations and it was confirmed that bandwidth division loss can be avoided with the proposed method.

A generalized varying-parameter recurrent neural network for super solution of quadratic programming problem

2021 ◽  
Vol 437 ◽  
pp. 238-248
Author(s):  
Y. Kong ◽  
Y. Jiang ◽  
R. Han ◽  
H. Wu
Keyword(s):  
Neural Network ◽  
Quadratic Programming ◽  
Programming Problem ◽  
Recurrent Neural Network ◽  
Quadratic Programming Problem

A kernel path algorithm for general parametric quadratic programming problem

2021 ◽  
Vol 116 ◽  
pp. 107941
Author(s):  
Bin Gu ◽  
Ziran Xiong ◽  
Shuyang Yu ◽  
Guansheng Zheng
Keyword(s):  
Quadratic Programming ◽  
Programming Problem ◽  
Quadratic Programming Problem ◽  
Parametric Quadratic Programming
Sign in / Sign up

Export Citation Format

Share Document