Search Results1-16 of  16

  • NUMATA Kazumiti ID: 9000241627469

    Articles in CiNii:1

    • Soft Tabu Search for Solving Motif Extraction Problem (2013)
  • NUMATA Kazumiti ID: 9000020259505

    Department of Management Science, Fuculty of Engineering, Tokyo University of Science (2005 from CiNii)

    Articles in CiNii:1

    • An Application of Lagrangian Relaxation Method to the Piston Delivery Scheduling Problem with Time-Windows (2005)
  • NUMATA Kazumiti ID: 9000258683782

    Tokyo University of Science (2006 from CiNii)

    Articles in CiNii:1

    • Equitable path assignment problem on the capacitated network (2006)
  • NUMATA Kazumiti ID: 9000258683788

    Tokyo University of Science (2006 from CiNii)

    Articles in CiNii:1

    • A heuristic algorithm for scheduling input/output tasks at automated warehouses (2006)
  • NUMATA Kazumiti ID: 9000391902772

    Faculty of Engineering, Tokyo University of Science (2005 from CiNii)

    Articles in CiNii:1

    • Application of GI Method to the soft-margin extended support vector machines (2005)
  • NUMATA Kazumiti ID: 9000391903523

    Faculty of Engineering, Tokyo University of Science (2005 from CiNii)

    Articles in CiNii:1

    • Flowshop scheduling problem with the job-transportation between machines (2005)
  • Numata Kazumiti ID: 1000030106893

    Graduate School of Engineering, Tokyo University of Science (2013 from CiNii)

    Articles in CiNii:29

    • On a Meta-Heuristic Algorithm Based on Size Reduction by Fixing Variables through Selection Bias (1999)
    • Experiments of a New Meta-Heuristics to Reduce the Search Space by Partially Fixing of the Solution Values-Application to Traveling Salesman Problem (2004)
    • A Heuristic Algorithm Based on a Local Search and a Search Space Reduction Strategy for the Multidimensional Knapsack Problem (2004)
  • Numata Kazumiti ID: 9000002419586

    電気通信大学情報数理工学科 (1985 from CiNii)

    Articles in CiNii:3

    • Computer as a Model and Computer as a Tool : CP/M-80 simulator on VOS3/TSS (1985)
    • A Comparison of PASCAL and ALGOL 68 (1979)
    • An Implementation of Intelligent Terminal Software on LISP System (1984)
  • Numata Kazumiti ID: 9000002760015

    電気通信大学 (1990 from CiNii)

    Articles in CiNii:2

    • APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS (1988)
    • 単体内の点集合の分割について(LP新解法) (1990)
  • Numata Kazumiti ID: 9000002760080

    Department of Computer Science and Information Mathematics, The University of Electro-Communications (1989 from CiNii)

    Articles in CiNii:1

    • PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS (1989)
  • Numata Kazumiti ID: 9000021961578

    Faculty of Engineering, Tokyo University of Science (2012 from CiNii)

    Articles in CiNii:1

    • Searching characteristics of chaotic neurodynamics for combinatorial optimization (2012)
  • Numata Kazumiti ID: 9000283354360

    Graduate School of Engineering, Tokyo University of Science (2013 from CiNii)

    Articles in CiNii:1

    • Heuristic Methods for the Bike-Sharing System Routing Problem (2013)
  • Numata Kazumiti ID: 9000391903533

    Tokyo University of Science (2008 from CiNii)

    Articles in CiNii:1

    • Heuristic Algorithms for the Knapsack-Scheduling-Problem (2008)
  • Numata Kazumiti ID: 9000391903536

    Tokyo University of Science (2008 from CiNii)

    Articles in CiNii:1

    • Effects of initial solution based on the relaxed problem for heuristic Search method:For the AS/RS problem (2008)
  • Numata Kazumiti ID: 9000391905027

    Tokyo University of Science (2009 from CiNii)

    Articles in CiNii:1

    • An Exact Algorithm based on Bounding Procedure for the Input-Output Scheduling Problem in Automated Warehouses (2009)
  • Numata Kazumiti ID: 9000391906408

    Tokyo University of Science (2010 from CiNii)

    Articles in CiNii:1

    • Effects of Exact Column Generation Accelerated by Lagrangean Relaxation for the Input-Output Scheduling Problem in Automated Warehouses (2010)
Page Top