Largest volume inscribed rectangles in convex sets defined by finite number of inequalities
Year of publication: |
2024
|
---|---|
Authors: | Behroozi, Mehdi |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 3, p. 787-819
|
Subject: | approximation algorithms | computational geometry | convex analysis | geometric optimization | inner and outer shape approximation | maximum volume inscribed box | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Mathematik | Mathematics |
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
-
Algorithmic aspects of some notions in classical mathematics
Lovász, László, (1984)
-
Mathematics of Neural Networks : Models, Algorithms and Applications
Ellacott, Stephen W., (1997)
- More ...
-
Wasserstein distance and the distributionally robust TSP
Carlsson, John Gunnar, (2018)
-
Household-level economies of scale in transportation
Carlsson, John Gunnar, (2016)
-
Worst-case demand distributions in vehicle routing
Carlsson, John Gunnar, (2017)
- More ...