Published in: LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024)
Peng Lin, Mengchuan Zou, and Shaowei Cai. An Efficient Local Search Solver for Mixed Integer Programming. In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 307, pp. 19:1-19:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{lin_et_al:LIPIcs.CP.2024.19, author = {Lin, Peng and Zou, Mengchuan and Cai, Shaowei}, title = {{An Efficient Local Search Solver for Mixed Integer Programming}}, booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)}, pages = {19:1--19:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-336-2}, ISSN = {1868-8969}, year = {2024}, volume = {307}, editor = {Shaw, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.19}, URN = {urn:nbn:de:0030-drops-207041}, doi = {10.4230/LIPIcs.CP.2024.19}, annote = {Keywords: Mixed Integer Programming, Local Search, Operator, Scoring Function} }
Published in: LIPIcs, Volume 305, 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
Yi Chu, Chu-Min Li, Furong Ye, and Shaowei Cai. Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 305, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chu_et_al:LIPIcs.SAT.2024.8, author = {Chu, Yi and Li, Chu-Min and Ye, Furong and Cai, Shaowei}, title = {{Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme}}, booktitle = {27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-334-8}, ISSN = {1868-8969}, year = {2024}, volume = {305}, editor = {Chakraborty, Supratik and Jiang, Jie-Hong Roland}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.8}, URN = {urn:nbn:de:0030-drops-205301}, doi = {10.4230/LIPIcs.SAT.2024.8}, annote = {Keywords: Weighted Partial MaxSAT, Local Search Method, Weighting Scheme} }
Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, and Yu Yokoi. Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{goko_et_al:LIPIcs.STACS.2022.31, author = {Goko, Hiromichi and Makino, Kazuhisa and Miyazaki, Shuichi and Yokoi, Yu}, title = {{Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.31}, URN = {urn:nbn:de:0030-drops-158414}, doi = {10.4230/LIPIcs.STACS.2022.31}, annote = {Keywords: Stable matching, Hospitals/Residents problem, Lower quota, NP-hardness, Approximation algorithm, Strategy-proofness} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Koki Hamada, Shuichi Miyazaki, and Hiroki Yanagisawa. Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hamada_et_al:LIPIcs.ISAAC.2019.9, author = {Hamada, Koki and Miyazaki, Shuichi and Yanagisawa, Hiroki}, title = {{Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.9}, URN = {urn:nbn:de:0030-drops-115059}, doi = {10.4230/LIPIcs.ISAAC.2019.9}, annote = {Keywords: Stable marriage problem, strategy-proofness, approximation algorithm, ties, incomplete lists} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Shuichi Miyazaki and Kazuya Okamoto. Jointly Stable Matchings. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 56:1-56:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{miyazaki_et_al:LIPIcs.ISAAC.2017.56, author = {Miyazaki, Shuichi and Okamoto, Kazuya}, title = {{Jointly Stable Matchings}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.56}, URN = {urn:nbn:de:0030-drops-82244}, doi = {10.4230/LIPIcs.ISAAC.2017.56}, annote = {Keywords: stable marriage problem, stable matching, NP-completeness, linear time algorithm} }
Published in: LIPIcs, Volume 53, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Sushmita Gupta, Kazuo Iwama, and Shuichi Miyazaki. Total Stability in Stable Matching Games. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 23:1-23:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{gupta_et_al:LIPIcs.SWAT.2016.23, author = {Gupta, Sushmita and Iwama, Kazuo and Miyazaki, Shuichi}, title = {{Total Stability in Stable Matching Games}}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)}, pages = {23:1--23:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-011-8}, ISSN = {1868-8969}, year = {2016}, volume = {53}, editor = {Pagh, Rasmus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.23}, URN = {urn:nbn:de:0030-drops-60450}, doi = {10.4230/LIPIcs.SWAT.2016.23}, annote = {Keywords: stable matching, Gale-Shapley algorithm, manipulation, stability, Nash equilibrium} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, and Hiroki Yanagisawa. A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 361-380, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{huang_et_al:LIPIcs.APPROX-RANDOM.2015.361, author = {Huang, Chien-Chung and Iwama, Kazuo and Miyazaki, Shuichi and Yanagisawa, Hiroki}, title = {{A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {361--380}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.361}, URN = {urn:nbn:de:0030-drops-53123}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.361}, annote = {Keywords: stable marriage with ties and incomplete lists, approximation algorithm, integer program, linear program relaxation, integrality gap} }