Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-023-01054-1
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yun-Bin Zhao & Zhi-Quan Luo, 2017. "Constructing New Weighted ℓ 1 -Algorithms for the Sparsest Points of Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 57-76, January.
- EDMONDS, Jack & GILES, Rick, 1977. "A min-max relation for submodular functions on graphs," LIDAM Reprints CORE 301, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- R. Chandrasekaran & S. N. Kabadi & R. Sridhar, 1998. "Integer Solution for Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 390-402, May.
- Weili Zhang & Charles D. Nicholson, 2020. "Objective scaling ensemble approach for integer linear programming," Journal of Heuristics, Springer, vol. 26(1), pages 1-19, February.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Hanna Sumita & Naonori Kakimura & Kazuhisa Makino, 2019. "Total dual integrality of the linear complementarity problem," Annals of Operations Research, Springer, vol. 274(1), pages 531-553, March.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005.
"Computing Integral Solutions of Complementarity Problems,"
Other publications TiSEM
b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "Computing integral solutions of complementarity problems," Other publications TiSEM 6f3abdc6-b961-4466-8e60-2, Tilburg University, School of Economics and Management.
- Gerard van der Laan & Dolf Talman & Zaifu Yang, 2005. "Computing Integral Solutions of Complementarity Problems," Tinbergen Institute Discussion Papers 05-006/1, Tinbergen Institute.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Discussion Paper 2005-5, Tilburg University, Center for Economic Research.
- András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
- Xujin Chen & Guoli Ding & Xiaodong Hu & Wenan Zang, 2006. "A Min-Max Relation on Packing Feedback Vertex Sets," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 777-788, November.
- Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
- Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
- Alexandre Skoda, 2019. "Convexity of graph-restricted games induced by minimum partitions," Post-Print halshs-01617023, HAL.
- Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
- M. Cai & X. Yang & Y. Li, 2000. "Inverse Problems of Submodular Functions on Digraphs," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 559-575, March.
- Alexandre Skoda, 2016. "Inheritance of Convexity for Partition Restricted," Documents de travail du Centre d'Economie de la Sorbonne 16040, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Ali Aouad & Vivek Farias & Retsef Levi, 2021. "Assortment Optimization Under Consider-Then-Choose Choice Models," Management Science, INFORMS, vol. 67(6), pages 3368-3386, June.
- Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Alexandre Skoda, 2017. "Inheritance of Convexity for the P min-Restricted Game," Post-Print halshs-01660670, HAL.
- Alexandre Skoda, 2016. "Inheritance of Convexity for Partition Restricted Games," Post-Print halshs-01318105, HAL.
- Alexandre Skoda, 2017. "Inheritance of Convexity for the P min-Restricted Game," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01660670, HAL.
- Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
- Hanna Sumita & Naonori Kakimura & Kazuhisa Makino, 2015. "The Linear Complementarity Problems with a Few Variables per Constraint," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1015-1026, October.
- Alexandre Skoda, 2017. "Convexity of Graph-Restricted Games Induced by Minimum Partitions," Post-Print halshs-01659804, HAL.
- Alexander Bockmayr & Friedrich Eisenbrand, 2001. "Cutting Planes and the Elementary Closure in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 304-312, May.
- Alexandre Skoda, 2016. "Complexity of inheritance of F-convexity for restricted games induced by minimum partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01382502, HAL.
More about this item
Keywords
Integer programming; Non-negative partial s-goodness; Weighted linear programming; Sparse optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01054-1. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.