Design and Analysis of Algorithms Based on the Discrete Model

Qiong Guan; Jian Bin Fang

doi:10.4028/www.scientific.net/AMR.791-793.1188

Paper Titles

Bi-Level Programming Models Applied in Urban Transportation Network Design Problems
p.1172

Applied Research of Improved Hybrid Genetic Algorithm in Multiple Constraints Location - Routing Problem
p.1176

Reliability Evaluation and Management in Simulation Systems
p.1180

The Application of Open Scene Graph Technology in Visualization of Flight Simulation
p.1184

Design and Analysis of Algorithms Based on the Discrete Model
p.1188

Study of Canonical Correlation Analysis Algorithm Based on Kernel Function
p.1191

Application of Artificial Immune Algorithm in the Capacitated Arc Routing Problem
p.1195

Design and Simulation of the Exoskeleton Robot
p.1199

Research on the Parameter Model Simulation Based on Computer Simulation Basketball Match
p.1203

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 791-793Design and Analysis of Algorithms Based on the...

Design and Analysis of Algorithms Based on the Discrete Model

Abstract:

With the widely use of discrete problems in production scheduling, traffic control, logistics, management science and social science, the restraint of the integer solution to the discrete problem, adding to the difficulties. In this paper, knapsack problem as an example, the computational accuracy and computation in the next, studied the design and analysis of algorithms for solving discrete problems.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1188-1190

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.791-793.1188

Citation:

Cite this paper

Online since:

September 2013

Authors:

Qiong Guan, Jian Bin Fang

Keywords:

Discrete Problem, Dynamic Programming, Optimization

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Cardin, Ronald L. Optimization Operations Research [M] Beijing: Publishing House of Electronics Industry: Pearson Education Asia Limited, 2007. 1.

Google Scholar

[2] HE Yi-cha, WANG Yan-di and LIU Jian-qin. A New Binary Particle Swarm Optimization for Solving Discrete Problems [J]. Computer Applications and Software, 2007, 1: 157-159.

Google Scholar

[3] ZHOU Shu-zi and CHEN Guang-zhou. An Iterative Method for Solving the Discrete Problem of a Variation Inequality [J]. Numerical Methods and Computer Applications, 2006, 02: 81-85.

Google Scholar

[4] GONG Shu-Mei1, ZHANG Xiao-Hui, LI Shao-Kun，Bin Packing Problem With Rejection Cost And Its Heuristic Algorithm [J]. Journal of Yunnan University of Nationalities, 2012, 1: 30-34.

Google Scholar

[5] WANG Neng-chao, Computational Methods [M], Wuhan: Publishing House of Hashing University of Science and Technology, 2010, 2.

Google Scholar