No article text was recorded for this version.
integrality-preserving linear relaxation
Version 2 of 2102 papers149 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On polynomially solvable constrained input selections for fixed and switched linear structured systems
- Blog: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
- Blog: On a cardinality-constrained transportation problem with market choice
- Blog: Single-Peakedness and Total Unimodularity: New Polynomial-Time Algorithms for Multi-Winner Elections
- Blog: Total Unimodularity and Strongly Polynomial Solvability of Constrained Minimum Input Selections for Structural Controllability: An LP-Based Method
- Blog: Some Tractable Combinatorial Auctions
- Blog: Making Existing Clusterings Fairer: Algorithms, Complexity Results and Insights
- Blog: Learning Neighborhoods for Metric Learning
- Blog: Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems
- Blog: Pruning Random Forests for Prediction on a Budget
- Blog: A Framework for Routing DNN Inference Jobs over Distributed Computing Networks
- Blog: Structured Prediction by Least Squares Estimated Conditional Risk Minimization.
- Blog: Learning from Label Proportion with Online Pseudo-Label Decision by Regret Minimization
- Blog: Optimally Pruning Decision Tree Ensembles With Feature Cost
- Blog: Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities
- Blog: Efficient Ordered Combinatorial Semi-Bandits for Whole-Page Recommendation
- Blog: Optimizing Urban Service Allocation with Time-Constrained Restless Bandits
- Blog: Eliminating Majority Illusion Is Easy
- Blog: Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
- Blog: FASS: A Fairness-Aware Approach for Concurrent Service Selection with Constraints
- Blog: Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
- Blog: Massively Parallel Benders Decomposition for Correlation Clustering
- Blog: Preferences Single-Peaked on a Circle
- Blog: On The Projection Operator to A Three-view Cardinality Constrained Set
- Blog: User Association in Massive MIMO HetNets
- Blog: MS-DPPs: Multi-Source Determinantal Point Processes for Contextual Diversity Refinement of Composite Attributes in Text to Image Retrieval
- Blog: Charging station optimization for balanced electric car sharing
- Blog: Packing and Partitioning Orbitopes
- Blog: Stochastic Model Predictive Control for Autonomous Mobility on Demand
- Blog: On Integrated Clustering and Outlier Detection
- Blog: Planning Strategies for Lane Reversals in Transportation Networks
- Blog: A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
- Blog: Optimal and Scalable MAPF via Multi-Marginal Optimal Transport and Schrödinger Bridges
- Blog: Decomposition of Trees and Paths via Correlation
- Blog: Finding total unimodularity in optimization problems solved by linear programs
- Blog: A constant FPT approximation algorithm for hard-capacitated k-means
- Blog: Coreference Clustering using Column Generation
- Blog: A totally unimodular view of structured sparsity
- Blog: A Dual Approach for Hierarchical Information-Theoretic Tree Abstractions
- Blog: A totally unimodular view of structured sparsity
- Blog: Learning to segment under various forms of weak supervision
- Blog: Planning Strategies for Lane Reversals in Transportation Networks
- Blog: Pricing and clearing combinatorial markets with singleton and swap orders: Efficient algorithms for the futures opening auction problem
- Blog: Realizing temporal transportation trees
- Blog: Achieving QoS for Real-Time Bursty Applications over Passive Optical Networks
- Blog: RAISE: Optimizing RIS Placement to Maximize Task Throughput in Multi-Server Vehicular Edge Computing
- Blog: Approximation Algorithms for Fair Range Clustering
- Blog: Flow Network Tracking for Spatiotemporal and Periodic Point Matching: Applied to Cardiac Motion Analysis
- Blog: A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians
- Blog: On a linear programming approach to the discrete Willmore boundary value problem and generalizations
- Blog: Bike-Repositioning Using Volunteers: Crowd Sourcing with Choice Restriction
- Blog: Tractability of Interpretability via Selection of Group-Sparse Models
- Blog: The b-branching problem in digraphs
- Blog: Maximum margin partial label learning
- Blog: Group-Sparse Model Selection: Hardness and Relaxations.
- Blog: An Incentive Compatible, Efficient Market for Air Traffic Flow Management
- Blog: Think out of the package: Recommending package types for e-commerce shipments
- Blog: Parameterized Analysis of Bribery in Challenge the Champ Tournaments
- Blog: Kombinatorikus Optimalizálás: Algoritmusok, Strukturák, Alkalmazások = Combinatorial optimization: algorithms, structures, applications
- Blog: Parameterized Algorithms for MILPs with Small Treedepth
Showing 60 of 102 papers.
History & citation
Current · Permanent link
- The Complexity of Selecting Overlapping Sparse Groups merged into this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_integrality_preserving_linear_relaxation_75c2ed2a,
title = {integrality-preserving linear relaxation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/integrality-preserving-linear-relaxation/rdr_75c2ed2a73b643868eba085b1fd2a4bb},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_integrality_preserving_linear_relaxation_75c2ed2a_v2,
title = {integrality-preserving linear relaxation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/integrality-preserving-linear-relaxation/rdr_75c2ed2a73b643868eba085b1fd2a4bb/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}