Solving Integer and Mixed Integer Linear Problems with ABS Method

Abaffy, József; von Neumann, John; Fodor, Szabina; Gomory, R; Balas, E; Ceria, S; Cornujols, G; Natraj, N; Zanette, A; Fischetti, M; Balas, E; Abaffy, J; Abaffy, J; Broyden, C; Spedicato, E; Abaffy, J; Spedicato, E; Spedicato, E; Xia, Z; Zhang, L; Spedicato, E; Xia, Z; Zhang, L; Abaffy, J; L; X-J; Z-Q, X; Zou, M.-F; Xia, Z.-Q; Esmaeili, H; Mahdavi-Amiri, N; Spedicato, E; Esmaeili, H; Mahdavi-Amiri, N; Spedicato, E; Fodor, S; Fodor, S; Fodor, S

doi:10.12700/aph.10.07.2013.7.7

Public

Solving Integer and Mixed Integer Linear Problems with ABS Method

Published in Acta Polytechnica Hungarica • Oct 20, 2013

NobleIDark:/48914/w1/20260525/5AEBDBF0Record on NobleID

Authors:

József Abaffy

,

John von Neumann

,

Szabina Fodor

Abstract

Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or...

Subject

Integer (computer science)

Integer programming

Branch and price

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!