No article text was recorded for this version.
binary search on objective value
Version 1 of 145 papers46 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A reformulation-enumeration MINLP algorithm for gas network design
- Blog: The Age of Incorrect Information: An Enabler of Semantics-Empowered Communication
- Blog: On the min-max-delay problem: NP-completeness, algorithm, and integrality gap
- Blog: Improved approximation algorithms for the Min-Max Selecting Items problem
- Blog: Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form
- Blog: Delay Minimization in Pinching-Antenna-Enabled NOMA-MEC Networks
- Blog: Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits
- Blog: A Linear-Time Algorithm for Generalized Trust Region Subproblems
- Blog: Throughput maximization in multiprocessor speed-scaling
- Blog: Selecting Observations against Adversarial Objectives
- Blog: Defending with Shared Resources on a Network
- Blog: Optimality and Scalability in Lattice Histogram Construction
- Blog: Approximation algorithm for submodular maximization under submodular cover
- Blog: PrefixKV: Adaptive Prefix KV Cache is What Vision Instruction-Following Models Need for Efficient Generation
- Blog: Exploiting duality in summarization with deterministic guarantees
- Blog: Fair Robust Assignment Using Redundancy
- Blog: Computing the Minimum Bottleneck Moving Spanning Tree
- Blog: Representative Solutions for Bi-Objective Optimisation
- Blog: Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
- Blog: Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment
- Blog: ALSO-X#: Better Convex Approximations for Distributionally Robust Chance Constrained Programs
- Blog: Constrained Interacting Submodular Groupings
- Blog: A Quasiconvex Formulation for Radial Cameras
- Blog: Logic Programming with Satisfiability
- Blog: Consistent Multiclass Algorithms for Complex Performance Measures
- Blog: Logarithmic Approximations for Fair k-Set Selection
- Blog: When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
- Blog: Optimizing Resilience in Large Scale Networks
- Blog: Algorithms and Hardness for Active Learning on Graphs
- Blog: Budget-constrained bulk data transfer via internet and shipping networks
- Blog: Optimal Weighted Load Balancing in TCAMs
- Blog: Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost
- Blog: Efficient Constrained K-center Clustering with Background Knowledge
- Blog: Patterson-Wiedemann type functions on 21 variables with Nonlinearity greater than Bent Concatenation bound
- Blog: Controlling Tail Risk in Online Ski-Rental
- Blog: B-bleaching: Agile Overtraining Avoidance in the WiSARD Weightless Neural Classifier
- Blog: Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness and Approximation Algorithm
- Blog: An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
- Blog: Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization
- Blog: Min-Max Problems on Factor Graphs
- Blog: Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost
- Blog: CD*: A Real-Time Resolution Optimal Re-Planner for Globally Constrained Problems
- Blog: Curriculum Design for Trajectory-Constrained Agent: Compressing Chain-of-Thought Tokens in LLMs
- Blog: Deterministic Consensus Maximization with Biconvex Programming
- Blog: Learning to Solve NP-Complete Problems: A Graph Neural Network for Decision TSP
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_binary_search_on_objective_value_ea9470ae,
title = {binary search on objective value},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/binary-search-on-objective-value/rdr_ea9470ae56ef4c93a26cf7f54a3965de},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_binary_search_on_objective_value_ea9470ae_v1,
title = {binary search on objective value},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/binary-search-on-objective-value/rdr_ea9470ae56ef4c93a26cf7f54a3965de/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}