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

DOI10.1007/978-3-031-33271-5_6MaRDI QIDQ6057248

Jihwan Jeong, Akshat Kumar, Scott Sanner

Publication date: 4 October 2023

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

zbMATH Keywords

bilinear programmingsymbolic variable elimination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Bilinear modeling solution approach for fixed charge network flow problems
• A new reformulation-linearization technique for bilinear programming problems
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Symbolic bucket elimination for piecewise continuous constrained optimization
• Generation of disjointly constrained bilinear programming test problems
• Introduction to global optimization
• A Bilinear Programming Approach for Multiagent Planning

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