Polyhedral combinatorics of bisectors

Authors: Jal, Aryaman, Jochemko, Katharina

Source: Advances in Geometry. 25(2):147-174

Subject Terms: Polyhedral norm, bisector, polyhedral combinatorics, Wasserstein distance

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-366151
https://doi.org/10.1515/advgeom-2025-0003

A polyhedral study of the maximum-impact coloring problem on hypergraphs.

Authors: Singer, Jessica¹ (AUTHOR), Marenco, Javier^1,2 (AUTHOR) javier.marenco@utdt.edu

Source: Discrete Applied Mathematics. Nov2025, Vol. 375, p105-121. 17p.

Subject Terms: *POLYHEDRAL combinatorics, *INTEGER programming, *NP-hard problems, *LECTURES & lecturing, *CLASSROOMS, *HYPERGRAPHS

On Constrained Mixed-Integer DR-Submodular Minimization.

Authors: Yu, Qimeng¹ (AUTHOR) kimyu@iro.umontreal.ca, Küçükyavuz, Simge² (AUTHOR) simge@northwestern.edu

Source: Mathematics of Operations Research. May2025, Vol. 50 Issue 2, p871-909. 39p.

Subject Terms: *ALGORITHMS, POLYHEDRAL combinatorics, NONLINEAR equations, CONTINUOUS functions, INTEGERS

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

Authors: Eisenbrand, Friedrich, Rohwedder, Lars, Wegrzycki, Karol

Source: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on. :1610-1620 Oct, 2024

Relation: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty: Recycling valid inequalities for robust combinatorial...: C. Büsing et al.

Authors: Büsing, Christina¹ (AUTHOR) buesing@combi.rwth-aachen.de, Gersing, Timo¹ (AUTHOR) gersing@combi.rwth-aachen.de, Koster, Arie M. C. A.² (AUTHOR) koster@math2.rwth-aachen.de

Source: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p97-146. 50p.

Subject Terms: *MATHEMATICAL programming, POLYHEDRAL combinatorics, ROBUST optimization, COMPUTATIONAL mathematics, COMBINATORIAL optimization

Optimizing for strategy diversity in the design of video games: Designing optimization problems with diverse solutions: O. Hanguir et al.

Authors: Hanguir, Oussama¹ (AUTHOR) oh2204@columbia.edu, Ma, Will² (AUTHOR) wm2428@gsb.columbia.edu, Han, Jiangze³ (AUTHOR) jiangze.han@sauder.ubc.ca, Ryan, Christopher Thomas³ (AUTHOR) chris.ryan@sauder.ubc.ca

Source: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p335-376. 42p.

Subject Terms: *LINEAR programming, VIDEO game design, POLYHEDRAL combinatorics, COMBINATORICS, POINT set theory

Rigidity of Nonconvex Polyhedra with Respect to Edge Lengths and Dihedral Angles

Authors: Cho, Yunhi^{Aff1, Aff2}, Kim, Seonhwa^{Aff1, IDs0045402400670w_cor1}

Source: Discrete & Computational Geometry. 74(2):302-336

Preprocessing and valid inequalities for exact detection of critical nodes via integer programming

Authors: Chen, Sheng-Jie^{Aff1, Aff2}, Chen, Liang^{Aff1, Aff2, IDs10589025006985_cor1}, Li, Guang-Ming, Dai, Yu-Hong^{Aff1, Aff2}

Source: Computational Optimization and Applications: An International Journal. :1-49

Polyhedral approach to weighted connected matchings in general graphs

Authors: Phillippe Samer, Phablo F.S. Moura

Source: Discrete Applied Mathematics

Subject Terms: G.4, FOS: Computer and information sciences, Combinatorial optimization, Induced connectivity, Discrete Mathematics (cs.DM), MINIMUM CUT-SETS, G.1.6, Mathematics, Applied, G.2.2, Polyhedral combinatorics, NP-COMPLETENESS, Computation Theory & Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), 0102 Applied Mathematics, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, 4901 Applied mathematics, Data Structures and Algorithms (cs.DS), connected subgraphs, polyhedral combinatorics, integer programming, 0802 Computation Theory and Mathematics, 4613 Theory of computation, Science & Technology, Connected matchings, induced connectivity, 4601 Applied computing, Integer programming, 90C27, 90C57, 90C11, 68R10, Connected subgraphs, Physical Sciences, connected matchings, combinatorial optimization, Combinatorics (math.CO), Mathematics, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2310.05733
https://hdl.handle.net/11250/3145882

Optimizing over path-length matrices of unrooted binary trees

Authors: Catanzaro, Daniele^{Aff1, IDs1010702502226z_cor1}, Pesenti, Raffaele, Sapucaia, Allan, Wolsey, Laurence

Source: Mathematical Programming: A Publication of the Mathematical Optimization Society. :1-53

Integer programming models and polyhedral study for the geodesic classification problem on graphs

Authors: Paulo H. M. Araújo, Manoel Campêlo, Ricardo C. Corrêa, Martine Labbé

Contributors: Labbé, Martine

Source: European Journal of Operational Research. 314:894-911

Subject Terms: Combinatorial optimization, geodesic convexity, 4. Education, Geodesic convexity, Integer programming, Polyhedral combinatorics, 15. Life on land, Classification, 16. Peace & justice, 7. Clean energy, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Informatique de gestion, classification, Informatique mathématique, Théorie de la décision et des choix collectifs, Recherche opérationnelle, polyhedral combinatorics

File Description: application/pdf; 1 full-text file(s): application/pdf

Access URL: https://cnrs.hal.science/hal-03727579v1/document
https://cnrs.hal.science/hal-03727579v1
https://doi.org/10.1016/j.ejor.2023.08.029

Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty: Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty

Authors: Omer, Jérémy, Poss, Michael, Rougier, Maxime

Contributors: Omer, Jérémy, Institut de Recherche Mathématique de Rennes (IRMAR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-Institut Agro Rennes Angers, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Methods, Algorithms for Operations REsearch (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Hexaly

Source: Open Journal of Mathematical Optimization, Vol 5, Iss, Pp 1-25 (2024)

Subject Terms: Robust combinatorial optimization, Combinatorial optimization, column generation, Column generation, robust combinatorial optimization, cutting plane, Cutting plane, Compact formulations, Robustness in mathematical programming, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], compact formulations, Mixed integer programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], QA1-939, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Mathematics

File Description: application/xml; application/pdf

Access URL: https://doaj.org/article/cf7c5ee482f544aaba5eb285a04e0147

Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs

Authors: Ma, Suxia, Gao, Yuelin, Zhang, Bo

Source: Journal of Applied Mathematics and Computing. 70:5917-5947

Subject Terms: computational complexity, output-space region reduction, Nonlinear programming, global optimization, generalized linear multiplicative program, Polyhedral combinatorics, branch-and-bound, branch-and-cut, branch-and-bound, Nonconvex programming, global optimization

File Description: application/xml

Access URL: https://zbmath.org/8036688
https://doi.org/10.1007/s12190-024-02202-4

A branch-and-cut algorithm for the windy profitable location rural postman problem

Authors: Mostafa Khorramizadeh, Roghayeh Javvi

Source: Annals of Operations Research. 341:993-1022

Subject Terms: Discrete location and assignment, branch-and-cut, facility location, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Integer programming, arc routing, windy graph, Programming involving graphs or networks

File Description: application/xml

Access URL: https://zbmath.org/7950222
https://doi.org/10.1007/s10479-024-06161-8

Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost

Authors: Kai Li, Fulong Xie, Jianfu Chen, Wei Xiao, Tao Zhou

Source: OR Spectrum. 47:129-176

Subject Terms: family setup times, Deterministic scheduling theory in operations research, branch-and-price algorithm, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Integer programming, scheduling, machine cost, Dynamic programming, unrelated parallel machines, Approximation methods and heuristics in mathematical programming

File Description: application/xml

Access URL: https://zbmath.org/8029127
https://doi.org/10.1007/s00291-024-00778-8

Data-driven confidence bound for structural response using segmented least squares: a mixed-integer programming approach

Authors: Yoshihiro Kanno

Source: Japan Journal of Industrial and Applied Mathematics. 41:1501-1534

Subject Terms: global optimization, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, mixed integer programming, Reliability, availability, maintenance, inspection in operations research, order statistics, Mixed integer programming, Optimization and Control (math.OC), Polyhedral combinatorics, branch-and-bound, branch-and-cut, FOS: Mathematics, Order statistics, empirical distribution functions, data-driven computing, 0101 mathematics, Mathematics - Optimization and Control, reliability with unknown distribution

File Description: application/xml

Access URL: http://arxiv.org/abs/2406.07793
https://zbmath.org/7922756
https://doi.org/10.1007/s13160-024-00657-3

Refined Integer Programs and Polyhedral Results for the Target Visitation Problem

Authors: Mallach, Sven

Contributors: Sven Mallach

Subject Terms: Traveling salesman problem, Branch-and-cut, Linear programming, Transportation, Logistics, Polyhedral Combinatorics, ddc:004, Route planning, Linear ordering problem, Integer Programming

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2025.8

Pivot Polytopes of Products of Simplices and Shuffles of Associahedra.

Authors: Pilaud, Vincent¹ (AUTHOR) vincent.pilaud@ub.edu, Poullot, Germain (AUTHOR)

Source: Discrete & Computational Geometry. Nov2025, p1-12.

Subject Terms: *POLYTOPES, *POLYHEDRAL combinatorics, *GEOMETRY, *ISOMORPHISM (Mathematics), *PERMUTATIONS

Polyhedral Structure of Maximal Gromov Hyperbolic Spaces with Finite Boundary.

Authors: Biswas, Kingshook (AUTHOR), Pal Choudhury, Arkajit¹ (AUTHOR) rkjtpalchoudhury_r@isical.ac.in

Source: Discrete & Computational Geometry. Oct2025, p1-41.

Subject Terms: *HYPERBOLIC spaces, *POLYHEDRAL combinatorics, *HOMEOMORPHISMS, *TEICHMULLER spaces, *GEODESIC spaces

New facets of the clique partitioning polytope.

Authors: Letchford, Adam N.¹ (AUTHOR) A.N.Letchford@lancaster.ac.uk, Sørensen, Michael M.² (AUTHOR) mim@econ.au.dk

Source: Operations Research Letters. Mar2025, Vol. 59, pN.PAG-N.PAG. 1p.

Subject Terms: *ALGORITHMS, COMBINATORIAL optimization, POLYHEDRAL combinatorics, POLYTOPES