A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems

DOI10.1287/ijoc.2022.1216OpenAlexW4292738002MaRDI QIDQ5060789

No author found.

Publication date: 11 January 2023

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2022.1216

zbMATH Keywords

branch-and-boundlinear complementarity problemsmixed integer programmingpenalty methodsmixed integer linear complementarity problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving discretely-constrained Nash-Cournot games with an application to power markets
• Solving discretely constrained, mixed linear complementarity problems with applications in energy
• New results on the equivalence between zero-one programming and continuous concave programming
• Exact penalty functions for nonlinear integer programming problems
• A hybrid smoothing method for mixed nonlinear complementarity problems
• Penalty parameter for linearly constrained 0--1 quadratic programming
• Solving discretely constrained mixed complementarity problems using a median function
• Total dual integrality of the linear complementarity problem
• Total dual integrality and integral solutions of the linear complementarity problem
• Branching rules revisited
• An RLT approach for solving the binary-constrained mixed linear complementarity problem
• Solving binary-constrained mixed complementarity problems using continuous reformulations
• Integral Solutions of Linear Complementarity Problems
• Integer Solution for Linear Complementarity Problem
• A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
• The Linear Complementarity Problem
• Global Optimization Approach to the Linear Complementarity Problem
• Linear complementarity problems solvable by integer programming
• The integer linear complementarity problem
• First-Order Methods in Optimization
• Experiments in mixed-integer linear programming
• The Unloading Problem for Plane Curves
• Benchmarking optimization software with performance profiles.

This page was built for publication: A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems