An Application of the Interior Point Method to Some Mixed Integer Programming Problems

Transactions of the Institute of Systems, Control and Information Engineers
doi 10.5687/iscie.14.71
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Institute of Systems, Control and Information Engineers

Related search

An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems

American Journal of Operations Research
2011English

Chvátal Closures for Mixed Integer Programming Problems

Mathematical Programming, Series B
MathematicsSoftware
1990English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Polyhedral Approaches to Mixed Integer Linear Programming

2009English

A Pre-Estimate Approach to Find a Good Initial Point to Integer Linear Programming Problems

2017English

An Interior Point Method for Linear Programming Based on a Class of Kernel Functions

Bulletin of the Australian Mathematical Society
Mathematics
2005English

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

Interior Path Methods for Heuristic Integer Programming Procedures.

1977English

A New Approach to the Feasibility Pump in Mixed Integer Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy