scientific article

zbMATH Open0555.90082MaRDI QIDQ3220358

J. F. Benders, Adrie J. M. Beulens, J. A. E. E. Van Nunen

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

assignment problemsmixed integer problemstight upper boundstime table problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A relaxation algorithm for solving mixed integer programming problems

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers 👍 👎
• A relaxation algorithm for solving mixed integer programming problems 👍 👎
• An efficient linearization approach for mixed-integer problems 👍 👎
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation 👍 👎
• Relaxation and decomposition methods for mixed integer nonlinear programming. 👍 👎
• Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming 👍 👎
• A mixed-integer linear programming problem which is efficiently solvable 👍 👎

This page was built for publication: