Skip to main content Skip to main navigation menu Skip to site footer
Journal of Computational Mathematics
  • Home
  • Editorial Board
  • Archives
  • Online First
  • Policies
    • Ethical Policy
    • The Use of Artificial Intelligence Policy
  • Guide for Authors
  • About
    • About the Journal
    • Order Journal
    • Contact Us
  • Register
  • Login
  • Register
  • Login
  1. Home /
  2. Search

Search

Advanced filters
Published After
Published Before

Search Results

##search.searchResults.foundPlural##
  • A Scaled Central Path for Linear Programming

    Ya-Xiang Yuan
    2001-02-02
    34165 3814 Pages:35-40
  • QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization

    Q. Ni
    1997-02-02
    32991 3793 Pages:36-54
  • Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming

    Gerald Gamrath, Ambros Gleixner, Thorsten Koch, Matthias Miltenberger, Dimitri Kniasew, Dominik Schlögel, Alexander Martin, Dieter Weninger
    2021-07-01
    46455 3896 Pages:866-888
  • Sequential Convex Programming Methods for Solving Large Topology Optimization Problems: Implementation and Computational Results

    Qin Ni, Ch. Zillober, K. Schittkowski
    2005-10-02
    33778 3466 Pages:491-502
  • A Fast Simplex Algorithm for Linear Programming

    Pingqi Pan
    2021-07-01
    34937 3624 Pages:837-847
  • An Interior Trust Region Algorithm for Nonlinear Minimization with Linear Constraints

    Jian-Guo Liu
    2002-06-02
    32541 3336 Pages:225-244
1 - 6 of 6 items
Global Science Press

A fast-growing scientific publisher based in Hong Kong & Vancouver, connecting researchers worldwide across mathematics, chemistry, physics, and computational sciences.

Quick Links
  • Browse Journals
  • Publish with Us
  • Open Access
  • Ethical Policy
  • Terms & Conditions
Resources
  • Partner with Us
  • For Authors
  • For Institutions
  • For Librarians
  • Editorial Process
About
  • About GSP
  • Contact Us
  • For Agents
  • For Users
© %2026 Global Science Press. All rights reserved.