A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination

DOI10.1007/978-3-031-33271-5_6MaRDI QIDQ6057248zbMATH OpenFDO

Authors Jihwan Jeong, Scott Sanner, Akshat Kumar

Publication date 4 October 2023

Published in Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-33271-5_6

zbMATH Keywords

bilinear programmingsymbolic variable elimination

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Cites work

• A Bilinear Programming Approach for Multiagent Planning
• A new reformulation-linearization technique for bilinear programming problems
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Bilinear modeling solution approach for fixed charge network flow problems
• Generation of disjointly constrained bilinear programming test problems
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 2243376 (Why is no real title available?)
• Introduction to global optimization
• Symbolic bucket elimination for piecewise continuous constrained optimization

Cited in

(1)

• Improved randomized approaches to the location of a conservative hyperplane

This page was built for publication: A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057248)