Solver-Informed RL: Grounding Large Language Models for Authentic Optimization Modeling.
CoRR, May, 2025
PDCS: A Primal-Dual Large-Scale Conic Programming Solver with GPU Enhancements.
CoRR, May, 2025
Beyond O(√T) Regret: Decoupling Learning and Decision-making in Online Linear Programming.
CoRR, January, 2025
An Enhanced Alternating Direction Method of Multipliers-Based Interior Point Method for Linear and Conic Optimization.
,
,
,
,
,
,
,
,
,
,
INFORMS J. Comput., 2025
Algorithm 1053: SOLNP+: A Derivative-Free Solver for Constrained Nonlinear Optimization.
ACM Trans. Math. Softw., December, 2024
FCT-Net: A dual-encoding-path network fusing atrous spatial pyramid pooling and transformer for pavement crack detection.
Eng. Appl. Artif. Intell., 2024
A Robust Anchor-based Method for Multi-Camera Pedestrian Localization.
CoRR, 2024
Reward Learning From Preference With Ties.
CoRR, 2024
Solving Integrated Process Planning and Scheduling Problem via Graph Neural Network Based Deep Reinforcement Learning.
CoRR, 2024
ORLM: Training Large Language Models for Optimization Modeling.
CoRR, 2024
A Homogenization Approach for Gradient-Dominated Stochastic Optimization.
Proceedings of the Uncertainty in Artificial Intelligence, 2024
Trust Region Methods for Nonconvex Stochastic Optimization beyond Lipschitz Smoothness.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Sketched Newton Value Iteration for Large-Scale Markov Decision Processes.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Learning to Pivot as a Smart Expert.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Pre-trained Mixed Integer Optimization through Multi-variable Cardinality Branching.
CoRR, 2023
Stochastic Dimension-reduced Second-order Methods for Policy Optimization.
CoRR, 2023
Solving Linear Programs with Fast Online Learning Algorithms.
Proceedings of the International Conference on Machine Learning, 2023
JD.com: Operations Research Algorithms Drive Intelligent Warehouse Robots to Work.
INFORMS J. Appl. Anal., 2022
Cardinal Optimizer (COPT) User Guide.
CoRR, 2022
DRSOM: A Dimension Reduced Second-Order Method and Preliminary Analyses.
CoRR, 2022
HDSDP: Software for Semidefinite Programming.
CoRR, 2022
Preface: Special Issue on the Annual International Conference on Combinatorial Optimization and Applications (COCOA).
Theor. Comput. Sci., 2019
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
A tractable discrete fractional programming: application to constrained assortment optimization.
J. Comb. Optim., 2018
A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs.
Oper. Res., 2018
An improved algorithm for the L<sub>2</sub> - L<sub>p</sub> minimization problem.
Math. Program., 2017
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions.
Proceedings of the 34th International Conference on Machine Learning, 2017
Strong NP-Hardness Result for Regularized $L_q$-Minimization Problems with Concave Penalty Functions.
CoRR, 2015
A Non-asymptotic Approach to Analyzing Kidney Exchange Graphs.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
Complexity of unconstrained $$L_2-L_p$$ minimization.
Math. Program., 2014
A Note on Appointment Scheduling with Piecewise Linear Cost Functions.
Math. Oper. Res., 2014
An Improved Algorithm for Fixed-Hub Single Allocation Problem.
CoRR, 2014
A genetic algorithm-based method for look-ahead scheduling in the finishing phase of construction projects.
Adv. Eng. Informatics, 2012
A note on the complexity of <i>L</i><sub><i>p</i></sub> minimization.
Math. Program., 2011
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming.
Math. Oper. Res., 2011
Geometric rounding: a dependent randomized rounding scheme.
J. Comb. Optim., 2011
The Cost of Cache-Oblivious Searching.
Algorithmica, 2011
Improved bounds on sorting by length-weighted reversals.
J. Comput. Syst. Sci., 2008
Improved bounds on sorting with length-weighted reversals.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004
Improved approximation algorithms for the freeze-tag problem.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003