Skip navigation
  • Browse
  • Items
    • Issue Date
    • Author
    • Title
    • Subject
  • Researchers
  • English
  • 繁體
  • 简体
  1. You are Here:National Chiao Tung University Institutional Repository
  2. Publications
  3. Research Plans

標題: 以超日晷法求解多項式整數規劃問題
A Super Gnomon Method for Solving Polynomial Integer Programs
作者: 黎漢林
LI HAN-LIN
國立交通大學資訊管理研究所
公開日期: 2014
官方說明文件#: NSC102-2221-E009-089-MY2
URI: http://hdl.handle.net/11536/99341
https://www.grb.gov.tw/search/planDetail?id=8125950&docId=433748
Appears in Collections:Research Plans


Related Contents
  • IR@NYCU
  • CrossRef
  • 以超日晷法求解多項式整數規劃問題 / 黎漢林;LI HAN-LIN
  • 以逐段線性技術求解混合整數規劃 / 黎漢林;LI HAN-LIN
  • Linear Reformulation of Polynomial Discrete Programming for Fast Computation / Li, Han-Lin;Huang, Yao-Huei;Fang, Shu-Cherng
  • 連續多項式近似最佳解法及其應用 / 周奇潭;Chou Chi Tarn;黎先生;Mr. Li
  • NONLINEAR INTEGER BILEVEL PROGRAMMING / JAN, RH;CHERN, MS
  • An approximate approach of global optimization for polynomial programming problems / Li, HL;Chang, CT
  • 考慮機台可用限制下最小化完工時間與共同到期日之絕對偏差 / 吳冠禾;李榮貴;Wu, Guan-He;Li, Rong-Kwei
  • 考慮起始時間之重置計畫: 完工時間之最小化 / 莊復嚴;Chuang, Fu-Yen;林妙聰;B.M.T Lin
Loading...


Copyright  ©  2002-2026   - Feedback - 
Powered by DSpace - Sitemap -  GitHub -  Sign on to:

Top