Skip header Section
Skip Bibliometrics Section
Introduction to Linear OptimizationFebruary 1997
- Authors:
- Dimitris Bertsimas,
- John Tsitsiklis
Abstract
No abstract available.
Cited By
- Song Y and Barton P (2024). Generalized derivatives of optimal-value functions with parameterized convex programs embedded, Journal of Global Optimization, 89:2, (355-378), Online publication date: 1-Jun-2024.
- Hu H, Li X, Im H and Wolkowicz H (2024). A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem, Mathematics of Operations Research, 49:2, (729-751), Online publication date: 1-May-2024.
- Kerimov S, Ashlagi I and Gurvich I (2024). Dynamic Matching, Management Science, 70:5, (2799-2822), Online publication date: 1-May-2024.
- Bertsimas D, ten Eikelder S, den Hertog D and Trichakis N (2024). Pareto Adaptive Robust Optimality via a Fourier–Motzkin Elimination lens, Mathematical Programming: Series A and B, 205:1-2, (485-538), Online publication date: 1-May-2024.
- Nannicini G (2024). Fast Quantum Subroutines for the Simplex Method, Operations Research, 72:2, (763-780), Online publication date: 1-Mar-2024.
- Liu L, Qi X and Xu Z (2024). Stabilizing Grand Cooperation via Cost Adjustment, INFORMS Journal on Computing, 36:2, (635-656), Online publication date: 1-Mar-2024.
- Diao S and Sen S (2024). Distribution-free algorithms for predictive stochastic programming in the presence of streaming data, Computational Optimization and Applications, 87:2, (355-395), Online publication date: 1-Mar-2024.
- Das Gupta S, Van Parys B and Ryu E (2024). Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods, Mathematical Programming: Series A and B, 204:1-2, (567-639), Online publication date: 1-Mar-2024.
- Cheng J, Nguyen D and Bhargava V (2024). Resilient Edge Service Placement Under Demand and Node Failure Uncertainties, IEEE Transactions on Network and Service Management, 21:1, (558-573), Online publication date: 1-Feb-2024.
- Geri A, Maccioni M, Meloni C, Nati L and Palazzoli A (2023). Power distribution network configuration applying the corridor method, Computers and Industrial Engineering, 186:C, Online publication date: 1-Dec-2023.
- Boutilier J, Michini C and Zhou Z (2023). Optimal multivariate decision trees, Constraints, 28:4, (549-577), Online publication date: 1-Dec-2023.
- Bonato A, Cushman R, Marbach T and Pittman B (2023). The localization game on oriented graphs, Discrete Applied Mathematics, 338:C, (145-157), Online publication date: 30-Oct-2023.
- Glasserman P and de Larrea E (2023). Maximum Entropy Distributions with Applications to Graph Simulation, Operations Research, 71:5, (1908-1924), Online publication date: 1-Sep-2023.
Zhou J, Bao Y, Jian D and Wu H PDAS: A Practical Distributed ADMM System for Large-Scale Linear Programming Problems at Alipay Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (5717-5727)- Yang C, Zhang Z, Cao B, Cui Z, Hu B, Li T, Long D, Qi J, Wang F and Zhan R Fragility Index: A New Approach for Binary Classification Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (2918-2929)
- Ibrahim S, Chen W, Hazimeh H, Ponomareva N, Zhao Z and Mazumder R COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Search Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (832-844)
- Del Pia A and Di Gregorio S (2023). On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs, Algorithmica, 85:8, (2189-2213), Online publication date: 1-Aug-2023.
- Tang Z, Chang T, Ye X and Zha H Low-rank matrix recovery with unknown correspondence Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, (2111-2122)
- Bondugula K, Mazuelas S and Pérez A Efficient learning of minimax risk classifiers in high dimensions Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, (206-215)
- Castiglioni M, Marchesi A and Gatti N Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcomes Proceedings of the 24th ACM Conference on Economics and Computation, (412-448)
- Luo Q, Nagarajan V, Sundt A, Yin Y, Vincent J and Shahabi M (2023). Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets, Transportation Science, 57:4, (908-936), Online publication date: 1-Jul-2023.
- Zhou T, Yang Y and Wang W (2023). Differentiable Multi-Granularity Human Parsing, IEEE Transactions on Pattern Analysis and Machine Intelligence, 45:7, (8296-8310), Online publication date: 1-Jul-2023.
- Ji T, Ayday E, Yilmaz E and Li P (2023). Towards Robust Fingerprinting of Relational Databases by Mitigating Correlation Attacks, IEEE Transactions on Dependable and Secure Computing, 20:4, (2939-2953), Online publication date: 1-Jul-2023.
- Wang H, An J and Zhou H (2023). Task assignment strategy in LEO-muti-access edge computing based on matching game, Computing, 105:7, (1571-1596), Online publication date: 1-Jul-2023.
- Meskar E and Liang B (2023). Fair Multi-Resource Allocation in Heterogeneous Servers With an External Resource Type, IEEE/ACM Transactions on Networking, 31:3, (1244-1262), Online publication date: 1-Jun-2023.
- Mohr R, Coblenz M and Kirst P (2023). Globally optimal univariate spline approximations, Computational Optimization and Applications, 85:2, (409-439), Online publication date: 1-Jun-2023.
- Del Pia A and Ma M (2023). k-median: exact recovery in the extended stochastic ball model, Mathematical Programming: Series A and B, 200:1, (357-423), Online publication date: 1-Jun-2023.
- Chu H, Liang L, Toh K and Yang L (2023). An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, Computational Optimization and Applications, 85:1, (107-146), Online publication date: 1-May-2023.
- Altschuler J and Boix-Adserà E (2023). Polynomial-time algorithms for multimarginal optimal transport problems with structure, Mathematical Programming: Series A and B, 199:1-2, (1107-1178), Online publication date: 1-May-2023.
- Kaynar N and Siddiq A (2023). Estimating Effects of Incentive Contracts in Online Labor Platforms, Management Science, 69:4, (2106-2126), Online publication date: 1-Apr-2023.
- Asfour T, Park J, Yoshida E, Pan Z, Liu M, Gao X and Manocha D (2023). Joint search of optimal topology and trajectory for planar linkages, International Journal of Robotics Research, 42:4-5, (176-195), Online publication date: 1-Apr-2023.
- Liu Z, Conti A, Mitter S and Win M (2023). Communication-Efficient Distributed Learning Over Networks—Part II: Necessary Conditions for Accuracy, IEEE Journal on Selected Areas in Communications, 41:4, (1102-1119), Online publication date: 1-Apr-2023.
- Chicoisne R (2023). Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, Computational Optimization and Applications, 84:3, (789-831), Online publication date: 1-Apr-2023.
- Robbins H, Gutekunst S, Shmoys D and Williamson D GILP: An Interactive Tool for Visualizing the Simplex Algorithm Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1, (108-114)
- Wang J, Lu S, Liu H and Ban X (2023). Transportation Origin-Destination Demand Estimation with Quasi-Sparsity, Transportation Science, 57:2, (289-312), Online publication date: 1-Mar-2023.
- Yao Z, Jiang H, Jiang Y and Ran B (2023). A Two-Stage Optimization Method for Schedule and Trajectory of CAVs at an Isolated Autonomous Intersection, IEEE Transactions on Intelligent Transportation Systems, 24:3, (3263-3281), Online publication date: 1-Mar-2023.
- Mirheli A and Hajibabai L (2023). Charging Network Design and Service Pricing for Electric Vehicles With User-Equilibrium Decisions, IEEE Transactions on Intelligent Transportation Systems, 24:3, (2888-2902), Online publication date: 1-Mar-2023.
- Del Pia A (2023). Sparse PCA on fixed-rank matrices, Mathematical Programming: Series A and B, 198:1, (139-157), Online publication date: 1-Mar-2023.
- Luo S, Fan P, Xing H and Yu H (2022). Meeting Coflow Deadlines in Data Center Networks With Policy-Based Selective Completion, IEEE/ACM Transactions on Networking, 31:1, (178-191), Online publication date: 1-Feb-2023.
- Heinemann F, Klatt M and Munk A (2022). Kantorovich–Rubinstein Distance and Barycenter for Finitely Supported Measures: Foundations and Algorithms, Applied Mathematics and Optimization, 87:1, Online publication date: 1-Feb-2023.
- Mansoori F and Wei E A General Framework of Exact Primal-Dual First-Order Algorithms for Distributed Optimization ∗ 2019 IEEE 58th Conference on Decision and Control (CDC), (6386-6391)
- Govaert A, Cenedese C, Grammatico S and Cao M Relative Best Response Dynamics in finite and convex Network Games 2019 IEEE 58th Conference on Decision and Control (CDC), (3134-3139)
- Bahreinian M and Tron R A Computational Theory of Robust Localization Verifiability in the Presence of Pure Outlier Measurements 2019 IEEE 58th Conference on Decision and Control (CDC), (7824-7831)
- Fu X and Modiano E (2022). Joint Learning and Control in Stochastic Queueing Networks with Unknown Utilities, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 6:3, (1-32), Online publication date: 1-Dec-2022.
- Malik U and Javed M (2023). Ambient Intelligence assisted fog computing for industrial IoT applications, Computer Communications, 196:C, (117-128), Online publication date: 1-Dec-2022.
- Motamed M (2022). A hierarchically low-rank optimal transport dissimilarity measure for structured data, BIT, 62:4, (1945-1982), Online publication date: 1-Dec-2022.
- Chen F, Zhang J and Wen Z A near-optimal primal-dual method for off-policy learning in CMDP Proceedings of the 36th International Conference on Neural Information Processing Systems, (10521-10532)
- Liu Q, Xu W, Wang S and Fang Z Combinatorial bandits with linear constraints Proceedings of the 36th International Conference on Neural Information Processing Systems, (2997-3010)
- Hurtado Lange D and Maguluri S (2022). Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling, Mathematics of Operations Research, 47:4, (3129-3155), Online publication date: 1-Nov-2022.
- El Hamri M, Bennani Y and Falih I (2022). Hierarchical optimal transport for unsupervised domain adaptation, Machine Language, 111:11, (4159-4182), Online publication date: 1-Nov-2022.
- Bolusani S and Ralphs T (2022). A framework for generalized Benders’ decomposition and its application to multilevel optimization, Mathematical Programming: Series A and B, 196:1-2, (389-426), Online publication date: 1-Nov-2022.
- Luo F and Mehrotra S (2022). A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs, Mathematical Programming: Series A and B, 196:1-2, (673-717), Online publication date: 1-Nov-2022.
- Gupta S, Khodabakhsh A, Mortagy H and Nikolova E (2022). Electrical flows over spanning trees, Mathematical Programming: Series A and B, 196:1-2, (479-519), Online publication date: 1-Nov-2022.
- Nazir N, Dowling C, Choudhury S, Zoepf S and Ma K Optimal, centralized dynamic curbside parking space zoning 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC), (91-98)
- Omidvar M, Li X and Yao X (2022). A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization—Part II, IEEE Transactions on Evolutionary Computation, 26:5, (823-843), Online publication date: 1-Oct-2022.
- Brütting J, Senatore G and Fivet C (2022). MILP-based discrete sizing and topology optimization of truss structures: new formulation and benchmarking, Structural and Multidisciplinary Optimization, 65:10, Online publication date: 1-Oct-2022.
- Khorramfar R, Özaltın O, Kempf K and Uzsoy R (2022). Managing Product Transitions, INFORMS Journal on Computing, 34:5, (2828-2844), Online publication date: 1-Sep-2022.
- Liu T, Saldanha-da-Gama F, Wang S and Mao Y (2022). Robust Stochastic Facility Location, INFORMS Journal on Computing, 34:5, (2776-2803), Online publication date: 1-Sep-2022.
- Vitor F and Easton T (2022). Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Computational Optimization and Applications, 83:1, (211-246), Online publication date: 1-Sep-2022.
- Laiu M and Tits A (2022). An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, Mathematical Programming: Series A and B, 195:1-2, (327-366), Online publication date: 1-Sep-2022.
- Chen Y and Whitt W (2022). Applying optimization theory to study extremal GI/GI/1 transient mean waiting times, Queueing Systems: Theory and Applications, 101:3-4, (197-220), Online publication date: 1-Aug-2022.
- Bai Y, Huang Z, Lam H and Zhao D (2022). Rare-event Simulation for Neural Network and Random Forest Predictors, ACM Transactions on Modeling and Computer Simulation, 32:3, (1-33), Online publication date: 31-Jul-2022.
- Castiglioni M, Marchesi A and Gatti N Designing Menus of Contracts Efficiently: The Power of Randomization Proceedings of the 23rd ACM Conference on Economics and Computation, (705-735)
- Bertsimas D and Stellato B (2022). Online Mixed-Integer Optimization in Milliseconds, INFORMS Journal on Computing, 34:4, (2229-2248), Online publication date: 1-Jul-2022.
- Krivonozhko V, Afanasiev A, Førsund F and Lychev A (2022). Comparison of Different Methods for Estimation of Returns to Scale in Nonradial Data Envelopment Analysis Models, Automation and Remote Control, 83:7, (1136-1148), Online publication date: 1-Jul-2022.
- Liang Z, Chen H, Liu Y and Chen F (2022). Data Sensing and Offloading in Edge Computing Networks: TDMA or NOMA?, IEEE Transactions on Wireless Communications, 21:6, (4497-4508), Online publication date: 1-Jun-2022.
- Sobhani E, Comon P, Jutten C and Babaie-Zadeh M (2022). CorrIndex, Signal Processing, 195:C, Online publication date: 1-Jun-2022.
- Blumenthal D, Bougleux S, Dignös A and Gamper J (2022). Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching, Information Sciences: an International Journal, 596:C, (202-221), Online publication date: 1-Jun-2022.
- Oliveira F, de Sá E and de Souza S (2022). Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, Computers and Operations Research, 142:C, Online publication date: 1-Jun-2022.
- Cánovas M, Gisbert M, Klatte D and Parra J (2022). Projection-Based Local and Global Lipschitz Moduli of the Optimal Value in Linear Programming, Journal of Optimization Theory and Applications, 193:1-3, (280-299), Online publication date: 1-Jun-2022.
- Bertsimas D and Cory-Wright R (2022). A Scalable Algorithm for Sparse Portfolio Selection, INFORMS Journal on Computing, 34:3, (1489-1511), Online publication date: 1-May-2022.
- Ma H, Fang F and Parkes D (2022). Spatio-Temporal Pricing for Ridesharing Platforms, Operations Research, 70:2, (1025-1041), Online publication date: 1-Mar-2022.
- Bergman D, Bodur M, Cardonha C and Cire A (2022). Network Models for Multiobjective Discrete Optimization, INFORMS Journal on Computing, 34:2, (990-1005), Online publication date: 1-Mar-2022.
- Zheng J, Dong Q, Wang X, Zhang Y, Ma W and Ma Y (2022). Efficient processing of k-regret minimization queries with theoretical guarantees, Information Sciences: an International Journal, 586:C, (99-118), Online publication date: 1-Mar-2022.
- Del Pia A and Michini C (2022). Short Simplex Paths in Lattice Polytopes, Discrete & Computational Geometry, 67:2, (503-524), Online publication date: 1-Mar-2022.
- Atia G, Beckus A, Alkhouri I and Velasquez A (2021). Steady-State Planning in Expected Reward Multichain MDPs, Journal of Artificial Intelligence Research, 72, (1029-1082), Online publication date: 4-Jan-2022.
- Shi P (2022). Optimal Priority-Based Allocation Mechanisms, Management Science, 68:1, (171-188), Online publication date: 1-Jan-2022.
- Chou G, Ozay N and Berenson D (2022). Learning temporal logic formulas from suboptimal demonstrations: theory and experiments, Autonomous Robots, 46:1, (149-174), Online publication date: 1-Jan-2022.
- Martin A, Venable K and Mattei N Behavioral Stable Marriage Problems Distributed Artificial Intelligence, (150-170)
- He J, Kong Q, LUI H, LIU H and JI Y Linear Adjusting Programming in Factor Space IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, (537-541)
- Falsone A, Margellos K, Zizzo J, Prandini M and Garatti S New results on resource sharing problems with random agent arrivals and an application to economic dispatch in power systems 2021 60th IEEE Conference on Decision and Control (CDC), (5130-5135)
- Ahna D and Zheng L Efficient simulation for linear programming under uncertainty Proceedings of the Winter Simulation Conference, (1-12)
- Samer P and Haugland D (2021). Fixed cardinality stable sets, Discrete Applied Mathematics, 303:C, (137-148), Online publication date: 15-Nov-2021.
- Altschuler J and Boix-Adserà E (2021). Hardness results for Multimarginal Optimal Transport problems, Discrete Optimization, 42:C, Online publication date: 1-Nov-2021.
- Randel R, Aloise D, Blanchard S and Hertz A (2021). A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering, Data Mining and Knowledge Discovery, 35:6, (2341-2368), Online publication date: 1-Nov-2021.
- Rumpf A and Kaul H A Public Transit Network Optimization Model for Equitable Access to Social Services Proceedings of the 1st ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, (1-17)
- Borrero J and Lozano L (2021). Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, INFORMS Journal on Computing, 33:4, (1570-1589), Online publication date: 1-Oct-2021.
- Miao H and Wang J (2022). Scheduling elective and emergency surgeries at shared operating rooms with emergency uncertainty and waiting time limit, Computers and Industrial Engineering, 160:C, Online publication date: 1-Oct-2021.
- Wollenstein-Betech S, Paschalidis I and Cassandras C Planning Strategies for Lane Reversals in Transportation Networks 2021 IEEE International Intelligent Transportation Systems Conference (ITSC), (2131-2136)
- Magnanti T (2021). Optimization, Management Science, 67:9, (5349-5363), Online publication date: 1-Sep-2021.
- Zheng S and Chen Y Optimal Advertising for Information Products Proceedings of the 22nd ACM Conference on Economics and Computation, (888-906)
- Mazaheri B, Jain S and Bruck J Synthesizing New Expertise via Collaboration 2021 IEEE International Symposium on Information Theory (ISIT), (2447-2452)
- Khodadadian S, Ghassami A and Kiyavash N Impact of Data Processing on Fairness in Supervised Learning 2021 IEEE International Symposium on Information Theory (ISIT), (2643-2648)
- Nasirigerdeh R, Torkzadehmahani R, Baumbach J and Blumenthal D On the Privacy of Federated Pipelines Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, (1975-1979)
- Hwang F and Huang Y (2021). An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Computational Optimization and Applications, 79:3, (601-631), Online publication date: 1-Jul-2021.
- Subramanian S and Harsha P (2020). Demand Modeling in the Presence of Unobserved Lost Sales, Management Science, 67:6, (3803-3833), Online publication date: 1-Jun-2021.
- Rutledge K, Chou G and Ozay N Compositional safety rules for inter-triggering hybrid automata Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, (1-11)
- Lowalekar M, Varakantham P and Jaillet P (2021). Zone pAth Construction (ZAC) based Approaches for Effective Real-Time Ridesharing, Journal of Artificial Intelligence Research, 70, (119-167), Online publication date: 1-May-2021.
- Calmon A, Ciocan F and Romero G (2021). Revenue Management with Repeated Customer Interactions, Management Science, 67:5, (2944-2963), Online publication date: 1-May-2021.
- Ryan C and Smith R (2021). Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs, Mathematical Programming: Series A and B, 187:1-2, (253-285), Online publication date: 1-May-2021.
- Farhadi V, Mehmeti F, He T, Porta T, Khamfroush H, Wang S, Chan K and Poularakis K (2021). Service Placement and Request Scheduling for Data-Intensive Applications in Edge Clouds, IEEE/ACM Transactions on Networking, 29:2, (779-792), Online publication date: 1-Apr-2021.
- Sadraddini S and Belta C Feasibility envelopes for metric temporal logic specifications 2016 IEEE 55th Conference on Decision and Control (CDC), (5732-5737)
- Hao X, Zhao R, Yang T, Hu Y, Hu B and Qiu Y (2021). A risk-sensitive task offloading strategy for edge computing in industrial Internet of Things, EURASIP Journal on Wireless Communications and Networking, 2021:1, Online publication date: 23-Feb-2021.
- Raveendran N, Gu Y, Jiang C, Tran N, Pan M, Song L and Han Z (2021). Cyclic Three-Sided Matching Game Inspired Wireless Network Virtualization, IEEE Transactions on Mobile Computing, 20:2, (416-428), Online publication date: 1-Feb-2021.
- Yang Y, Fu Z, Zhan D, Liu Z and Jiang Y (2021). Semi-Supervised Multi-Modal Multi-Instance Multi-Label Deep Network with Optimal Transport, IEEE Transactions on Knowledge and Data Engineering, 33:2, (696-709), Online publication date: 1-Feb-2021.
- Bertsimas D and Stellato B (2020). The voice of optimization, Machine Language, 110:2, (249-277), Online publication date: 1-Feb-2021.
- Feit A, Nancel M, John M, Karrenbauer A, Weir D and Oulasvirta A (2021). AZERTY amélioré, Communications of the ACM, 64:2, (48-58), Online publication date: 25-Jan-2021.
- Dey S, Dubey Y and Molinaro M Branch-and-bound solves random binary IPs in polytime Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (579-591)
- Gupta V and Rusmevichientong P (2020). Small-Data, Large-Scale Linear Optimization with Uncertain Objectives, Management Science, 67:1, (220-241), Online publication date: 1-Jan-2021.
- Bertsimas D and Mundru N (2021). Sparse Convex Regression, INFORMS Journal on Computing, 33:1, (262-279), Online publication date: 1-Jan-2021.
- Mansoori F and Wei E (2021). FlexPD: A Flexible Framework of First-Order Primal-Dual Algorithms for Distributed Optimization, IEEE Transactions on Signal Processing, 69, (3500-3512), Online publication date: 1-Jan-2021.
- Chiang Y, Lin H, Ji Y and Liao W Freshness-aware Energy Saving in Cellular Systems with Cooperative Information Updates GLOBECOM 2020 - 2020 IEEE Global Communications Conference, (1-6)
- Agrawal S, Ishai Y, Kushilevitz E, Narayanan V, Prabhakaran M, Prabhakaran V and Rosen A Cryptography from One-Way Communication: On Completeness of Finite Channels Advances in Cryptology – ASIACRYPT 2020, (653-685)
- Tjandraatmadja C, Anderson R, Huchette J, Ma W, Patel K and Vielma J The convex relaxation barrier, revisited Proceedings of the 34th International Conference on Neural Information Processing Systems, (21675-21686)
- Wang Y and Scott C Weston-watkins hinge loss and ordered partitions Proceedings of the 34th International Conference on Neural Information Processing Systems, (19873-19883)
- Scetbon M and Cuturi M Linear time sinkhorn divergences using positive features Proceedings of the 34th International Conference on Neural Information Processing Systems, (13468-13480)
- Paulus M, Choi D, Tarlow D, Krause A and Maddison C Gradient estimation with stochastic softmax tricks Proceedings of the 34th International Conference on Neural Information Processing Systems, (5691-5704)
- Stahlbuhk T, Shrader B and Modiano E (2020). Throughput Maximization in Uncooperative Spectrum Sharing Networks, IEEE/ACM Transactions on Networking, 28:6, (2517-2530), Online publication date: 1-Dec-2020.
- Grosser T, Theodoridis T, Falkenstein M, Pitchanathan A, Kruse M, Rigger M, Su Z and Hoefler T (2020). Fast linear programming through transprecision computing on small and sparse data, Proceedings of the ACM on Programming Languages, 4:OOPSLA, (1-28), Online publication date: 13-Nov-2020.
- Abdelhadi A Multicasting Information for Internet of Things Wireless Networks Proceedings of the 9th International Conference on Software and Information Engineering, (152-158)
- Wilde N, Kulić D and Smith S Active Preference Learning using Maximum Regret 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (10952-10959)
- Yang I (2020). A Convex Optimization Approach to Dynamic Programming in Continuous State and Action Spaces, Journal of Optimization Theory and Applications, 187:1, (133-157), Online publication date: 1-Oct-2020.
- Iglesias J, Mercier G and Scherzer O (2018). Critical Yield Numbers and Limiting Yield Surfaces of Particle Arrays Settling in a Bingham Fluid, Applied Mathematics and Optimization, 82:2, (399-432), Online publication date: 1-Oct-2020.
- Taherkhani F, Dabouei A, Soleymani S, Dawson J and Nasrabadi N Transporting Labels via Hierarchical Optimal Transport for Semi-Supervised Learning Computer Vision – ECCV 2020, (509-526)
- Wideł W, Audinot M, Fila B and Pinchinat S (2019). Beyond 2014, ACM Computing Surveys, 52:4, (1-36), Online publication date: 31-Jul-2020.
- Basu K, Ghoting A, Mazumder R and Pan Y ECLIPSE Proceedings of the 37th International Conference on Machine Learning, (704-714)
- Garg V Predicate Detection to Solve Combinatorial Optimization Problems Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, (235-245)
- Ghasemi K, Sadraddini S and Belta C Compositional synthesis via a convex parameterization of assume-guarantee contracts Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control, (1-10)
- Bertsimas D and Dunning I (2019). Relative Robust and Adaptive Optimization, INFORMS Journal on Computing, 32:2, (408-427), Online publication date: 1-Apr-2020.
- Paschos G, Destounis A and Iosifidis G (2020). Online Convex Optimization for Caching Networks, IEEE/ACM Transactions on Networking, 28:2, (625-638), Online publication date: 1-Apr-2020.
- Yarmuch J, Brazil M, Rubinstein H and Thomas D (2021). Optimum ramp design in open pit mines, Computers and Operations Research, 115:C, Online publication date: 1-Mar-2020.
- González Pinto J and Balke W (2018). Assessing plausibility of scientific claims to support high-quality content in digital collections, International Journal on Digital Libraries, 21:1, (47-60), Online publication date: 1-Mar-2020.
- Cai W, Gaebler J, Garg N and Goel S Fair Allocation through Selective Information Acquisition Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, (22-28)
- Fauske M, Mannino C and Ventura P (2019). Generalized Periodic Vehicle Routing and Maritime Surveillance, Transportation Science, 54:1, (164-183), Online publication date: 1-Jan-2020.
- Rassouli B and Gündüz D (2019). Optimal Utility-Privacy Trade-Off With Total Variation Distance as a Privacy Measure, IEEE Transactions on Information Forensics and Security, 15, (594-603), Online publication date: 1-Jan-2020.
- Hahn E, Hashemi V, Hermanns H, Lahijanian M and Turrini A (2019). Interval Markov Decision Processes with Multiple Objectives, ACM Transactions on Modeling and Computer Simulation, 29:4, (1-31), Online publication date: 17-Dec-2019.
- Ma X, Aminian M and Kirby M (2019). Error-adaptive modeling of streaming time-series data using radial basis functions, Journal of Computational and Applied Mathematics, 362:C, (295-308), Online publication date: 15-Dec-2019.
- Ge D, Wang H, Xiong Z and Ye Y Interior-point methods strike back Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6894-6905)
- Cuturi M, Teboul O and Vert J Differentiable ranks and sorting using optimal transport Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6861-6871)
- Hezarjaribi N, Mazrouee S, Hemati S, Chaytor N, Perrigue M and Ghasemzadeh H (2019). Human-in-the-loop Learning for Personalized Diet Monitoring from Unstructured Mobile Data, ACM Transactions on Interactive Intelligent Systems, 9:4, (1-24), Online publication date: 5-Dec-2019.
- Hewitt M (2019). Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem, Transportation Science, 53:6, (1731-1750), Online publication date: 1-Nov-2019.
- Lamorgese L and Mannino C (2019). A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, Operations Research, 67:6, (1586-1609), Online publication date: 1-Nov-2019.
- Saccá D, Serra E and Rullo A (2022). Extending inverse frequent itemsets mining to generate realistic datasets: complexity, accuracy and emerging applications, Data Mining and Knowledge Discovery, 33:6, (1736-1774), Online publication date: 1-Nov-2019.
- Jain S and Biyani P Improved Real Time Ride Sharing via Graph Coloring 2019 IEEE Intelligent Transportation Systems Conference (ITSC), (956-961)
- Dai H, Izatt G and Tedrake R (2020). Global inverse kinematics via mixed-integer convex optimization, International Journal of Robotics Research, 38:12-13, (1420-1441), Online publication date: 1-Oct-2019.
- Li P, Ding Z and Feng K (2019). Enhanced Receiver Based on FEC Code Constraints for Uplink NOMA With Imperfect CSI, IEEE Transactions on Wireless Communications, 18:10, (4790-4802), Online publication date: 1-Oct-2019.
- Tavakoli-Someh S and Rezvani M (2019). Multi-objective virtual network function placement using NSGA-II meta-heuristic approach, The Journal of Supercomputing, 75:10, (6451-6487), Online publication date: 1-Oct-2019.
- Blanchet J, Li J and Nakayama M (2019). Rare-Event Simulation for Distribution Networks, Operations Research, 67:5, (1383-1396), Online publication date: 1-Sep-2019.
- Supittayapornpong S, Raghavan B and Govindan R Towards highly available clos-based WAN routers Proceedings of the ACM Special Interest Group on Data Communication, (424-440)
- Martinez A, Osaba E, Oregi I, Fister I, Fister I and Ser J Hybridizing differential evolution and novelty search for multimodal optimization problems Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1980-1989)
- Sreekumar S and Gündüz D Optimal Privacy-Utility Trade-off under a Rate Constraint 2019 IEEE International Symposium on Information Theory (ISIT), (2159-2163)
- Fattahi A, Dasu S and Ahmadi R (2019). Mass Customization and “Forecasting Options’ Penetration Rates Problem”, Operations Research, 67:4, (1120-1134), Online publication date: 1-Jul-2019.
- Udell M and Toole O (2019). Optimal Design of Efficient Rooftop Photovoltaic Arrays, Interfaces, 49:4, (281-294), Online publication date: 1-Jul-2019.
- Rahman H and Mahajan A (2019). Facets of a mixed-integer bilinear covering set with bounds on variables, Journal of Global Optimization, 74:3, (417-442), Online publication date: 1-Jul-2019.
- Das Gupta S and Pavel L (2019). On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems, Journal of Global Optimization, 74:3, (523-548), Online publication date: 1-Jul-2019.
- Tsiamis A and Maragos P (2019). Sparsity in max-plus algebra and systems, Discrete Event Dynamic Systems, 29:2, (163-189), Online publication date: 1-Jun-2019.
- Li C, Ouyang J and Li X Classifying Extremely Short Texts by Exploiting Semantic Centroids in Word Mover's Distance Space The World Wide Web Conference, (939-949)
- Celli A, Coniglio S and Gatti N Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, (909-917)
- Bertsimas D and Mišić V (2019). Exact First-Choice Product Line Optimization, Operations Research, 67:3, (651-670), Online publication date: 1-May-2019.
- Fox J, He X and Manners F (2019). A proof of Tomescu's graph coloring conjecture, Journal of Combinatorial Theory Series B, 136:C, (204-221), Online publication date: 1-May-2019.
- Wu J, Tawarmalani M and Kannan K (2019). Cardinality Bundling with Spence–Mirrlees Reservation Prices, Management Science, 65:4, (1891-1908), Online publication date: 1-Apr-2019.
- Lee I, Curry S and Serban N (2019). Solving Large Batches of Linear Programs, INFORMS Journal on Computing, 31:2, (302-317), Online publication date: 1-Apr-2019.
- Laiu M and Tits A (2019). A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Computational Optimization and Applications, 72:3, (727-768), Online publication date: 1-Apr-2019.
- Wang Y, Meng Q and Kuang H (2019). Intercontinental Liner Shipping Service Design, Transportation Science, 53:2, (344-364), Online publication date: 1-Mar-2019.
- Sauré D and Vielma J (2019). Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis, Operations Research, 67:2, (315-338), Online publication date: 1-Mar-2019.
- Kunnumkal S and Martínez-de-Albéniz V (2019). Tractable Approximations for Assortment Planning with Product Costs, Operations Research, 67:2, (436-452), Online publication date: 1-Mar-2019.
- Gupta S and Lozano A Computation-Bandwidth Trading for Mobile Edge Computing 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC), (1-6)
- Borrero J, Prokopyev O and Sauré D (2019). Sequential Interdiction with Incomplete Information and Learning, Operations Research, 67:1, (72-89), Online publication date: 1-Jan-2019.
- Carbajal J, Williams P, Popescu A and Chaar W (2020). Turner Blazes a Trail for Audience Targeting on Television with Operations Research and Advanced Analytics, Interfaces, 49:1, (64-89), Online publication date: 1-Jan-2019.
- Hill B, Kirszenblat D, Moran B and Novak A Optimizing recruitment to achieve operational capability conditional on appetite for risk Proceedings of the 2018 Winter Simulation Conference, (3801-3812)
- Jin S, Zhu Z, Shen C, Ali S, Qian H and Luo X Sparse Spectrum Reuse in HetNets with Relays 2018 IEEE Global Communications Conference (GLOBECOM), (1-7)
- Chiang Y, Liao W and Ji Y RELISH: Green Multicell Clustering in Heterogeneous Networks with Shareable Caching 2018 IEEE Global Communications Conference (GLOBECOM), (1-7)
- Chen X, Liu J, Wang Z and Yin W Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds Proceedings of the 32nd International Conference on Neural Information Processing Systems, (9079-9089)
- Luise G, Rudi A, Pontil M and Ciliberto C Differential properties of sinkhorn approximation for learning with wasserstein distance Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5864-5874)
- Farina G, Gatti N and Sandholm T Practical exact algorithm for trembling-hand equilibrium refinements in games Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5044-5054)
- Houshmand A and Cassandras C Eco-Routing of Plug-In Hybrid Electric Vehicles in Transportation Networks 2018 21st International Conference on Intelligent Transportation Systems (ITSC), (1508-1513)
- Schmidt C, Kottke C, Tanzil V, Freund R, Jungnickel V and Gerfers F (2018). Digital-to-Analog Converters Using Frequency Interleaving, Circuits, Systems, and Signal Processing, 37:11, (4929-4954), Online publication date: 1-Nov-2018.
- Bruni M, Di Puglia Pugliese L, Beraldi P and Guerriero F (2018). A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem, Computers and Operations Research, 99:C, (178-190), Online publication date: 1-Nov-2018.
- Liu L, Qi X and Xu Z (2018). Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation, Operations Research, 66:5, (1362-1375), Online publication date: 1-Oct-2018.
- Zhang J and Modiano E (2018). Connectivity in Interdependent Networks, IEEE/ACM Transactions on Networking, 26:5, (2090-2103), Online publication date: 1-Oct-2018.
- Zhao K, Jin J, Wang Y and Lee D (2018). Optimizing the Link Directions of Personal Rapid Transit Network, IEEE Transactions on Intelligent Transportation Systems, 19:10, (3414-3419), Online publication date: 1-Oct-2018.
- Deng D, Palli P, Shu F, Shimada K and Pang T Heterogeneous Vehicles Routing for Water Canal Damage Assessment 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (2375-2382)
- Gomez J, Höffner K, Khan K and Barton P (2018). Generalized Derivatives of Lexicographic Linear Programs, Journal of Optimization Theory and Applications, 178:2, (477-501), Online publication date: 1-Aug-2018.
- Akbari A and Barton P (2018). An Improved Multi-parametric Programming Algorithm for Flux Balance Analysis of Metabolic Networks, Journal of Optimization Theory and Applications, 178:2, (502-537), Online publication date: 1-Aug-2018.
- Yang Y, Wu Y, Zhan D, Liu Z and Jiang Y Complex Object Classification Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (2594-2603)
- Rassouli B and Gunduz D On Perfect Privacy 2018 IEEE International Symposium on Information Theory (ISIT), (2551-2555)
- Wilde N, Kulić D and Smith S Learning User Preferences in Robot Motion Planning Through Interaction 2018 IEEE International Conference on Robotics and Automation (ICRA), (619-626)
- Arzani B, Ciraci S, Chamon L, Zhu Y, Liu H, Padhye J, Loo B and Outhred G 007 Proceedings of the 15th USENIX Conference on Networked Systems Design and Implementation, (419-435)
- Ren X, London P, Ziani J, Wierman A, London P, Ziani J, Wierman A and Ren X (2018). Datum, IEEE/ACM Transactions on Networking, 26:2, (893-905), Online publication date: 1-Apr-2018.
- Deng H, Hou I, Hou I and Deng H (2018). Optimal Capacity Provisioning for Online Job Allocation With Hard Allocation Ratio Requirement, IEEE/ACM Transactions on Networking, 26:2, (724-736), Online publication date: 1-Apr-2018.
- Wu H and Küçükyavuz S (2018). A two-stage stochastic programming approach for influence maximization in social networks, Computational Optimization and Applications, 69:3, (563-595), Online publication date: 1-Apr-2018.
- Muñoz G, Espinoza D, Goycoolea M, Moreno E, Queyranne M and Letelier O (2018). A study of the Bienstock---Zuckerberg algorithm, Computational Optimization and Applications, 69:2, (501-534), Online publication date: 1-Mar-2018.
- Sou K (2017). Minimum equivalent precedence relation systems, Discrete Applied Mathematics, 233:C, (195-214), Online publication date: 31-Dec-2018.
- Falsone A, Margellos K, Garatti S and Prandini M Linear programs for resource sharing among heterogeneous agents: The effect of random agent arrivals 2017 IEEE 56th Annual Conference on Decision and Control (CDC), (3853-3858)
- You L, Lei L, Yuan D, Sun S, Chatzinotas S and Ottersten B A Framework for Optimizing Multi-Cell NOMA: Delivering Demand with Less Resource GLOBECOM 2017 - 2017 IEEE Global Communications Conference, (1-7)
- Chiang Y and Liao W Multicell Sleeping Control and Transmit Power Adaptation in Green Heterogeneous Networks GLOBECOM 2017 - 2017 IEEE Global Communications Conference, (1-6)
- Fillatre L (2017). Constructive minimax classification of discrete observations with arbitrary loss function, Signal Processing, 141:C, (322-330), Online publication date: 1-Dec-2017.
- Yuan B, Chen H and Yao X (2017). Optimal relay placement for lifetime maximization in wireless underground sensor networks, Information Sciences: an International Journal, 418:C, (463-479), Online publication date: 1-Dec-2017.
- Yajnanarayana V, Magnusson K, Brandt R, Dwivedi S and Händel P (2017). Optimal Scheduling for Interference Mitigation by Range Information, IEEE Transactions on Mobile Computing, 16:11, (3167-3181), Online publication date: 1-Nov-2017.
- Chen Y and Hasenbein J (2017). Staffing large-scale service systems with distributional uncertainty, Queueing Systems: Theory and Applications, 87:1-2, (55-79), Online publication date: 1-Oct-2017.
- Liang Q and Modiano E (2017). Survivability in Time-Varying Networks, IEEE Transactions on Mobile Computing, 16:9, (2668-2681), Online publication date: 1-Sep-2017.
- Lagos F, Ordez F and Labb M (2017). A branch and price algorithm for a Stackelberg Security Game, Computers and Industrial Engineering, 111:C, (216-227), Online publication date: 1-Sep-2017.
- Arzani B, Ciraci S, Chamon L, Zhu Y, Liu H, Padhye J, Outhred G and Loo B Closing the Network Diagnostics Gap with Vigil Proceedings of the SIGCOMM Posters and Demos, (40-42)
- Salinas S and Li P Secure Cloud Computing for Pairwise Sequence Alignment Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics, (178-183)
- Guo Q, An B, Bošansky B and Kiekintveld C Comparing strategic secrecy and stackelberg commitment in security games Proceedings of the 26th International Joint Conference on Artificial Intelligence, (3691-3699)
- Lindgren E, Dimakis A and Klivans A Exact MAP inference by avoiding fractional vertices Proceedings of the 34th International Conference on Machine Learning - Volume 70, (2120-2129)
- Bian A, Buhmann J, Krause A and Tschiatschek S Guarantees for Greedy maximization of non-submodular functions with applications Proceedings of the 34th International Conference on Machine Learning - Volume 70, (498-507)
- Civek B, Delibalta I and Kozat S (2017). Highly efficient hierarchical online nonlinear regression using second order methods, Signal Processing, 137:C, (22-32), Online publication date: 1-Aug-2017.
- Gu Y, Jiang C, Cai L, Pan M, Song L and Han Z (2017). Dynamic Path To Stability in LTE-Unlicensed With User Mobility: A Matching Framework, IEEE Transactions on Wireless Communications, 16:7, (4547-4561), Online publication date: 1-Jul-2017.
- Beck A and Shtern S (2017). Linearly convergent away-step conditional gradient for non-strongly convex functions, Mathematical Programming: Series A and B, 164:1-2, (1-27), Online publication date: 1-Jul-2017.
- Zhang H, Vorobeychik Y and Procaccia A Multi-Channel Marketing with Budget Complementarities Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (1232-1240)
- Rosa B, Souza M, de Souza S, de França Filho M, Ales Z and Michelon P (2017). Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Computers and Operations Research, 81:C, (203-215), Online publication date: 1-May-2017.
- Udomlamlert K, Hara T and Nishio S (2017). Subscription-based data aggregation techniques for top-k monitoring queries, World Wide Web, 20:2, (237-265), Online publication date: 1-Mar-2017.
- Gan J, An B, Vorobeychik Y and Gauch B Security games on a plane Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (530-536)
- Finger M and Bona G Algorithms for deciding counting quantifiers over unary predicates Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (3878-3884)
- Koch S (2017). Least squares approximate policy iteration for learning bid prices in choice-based revenue management, Computers and Operations Research, 77:C, (240-253), Online publication date: 1-Jan-2017.
- Huang G, Quo C, Kusner M, Sun Y, Weinberger K and Sha F Supervised word mover's distance Proceedings of the 30th International Conference on Neural Information Processing Systems, (4869-4877)
- Zhao J, Liu Y, Chai K, Chen Y, Elkashlan M and Alonso-Zarate J NOMA-Based D2D Communications: Towards 5G 2016 IEEE Global Communications Conference (GLOBECOM), (1-6)
- Gu Y, Cai L, Pan M, Song L and Han Z Exploiting the Stable Fixture Matching Game for Content Sharing in D2D-Based LTE-V2X Communications 2016 IEEE Global Communications Conference (GLOBECOM), (1-6)
- Wang C and Wang Z (2016). Signal Alignment for Secure Underwater Coordinated Multipoint Transmissions, IEEE Transactions on Signal Processing, 64:23, (6360-6374), Online publication date: 1-Dec-2016.
- Rahat A, Everson R and Fieldsend J (2016). Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks, Ad Hoc Networks, 52:C, (130-145), Online publication date: 1-Dec-2016.
- Sun X and Cassandras C (2016). Optimal dynamic formation control of multi-agent systems in constrained environments, Automatica (Journal of IFAC), 73:C, (169-179), Online publication date: 1-Nov-2016.
- Beyhaghi P and Bewley T (2016). Delaunay-based derivative-free optimization via global surrogates, part II, Journal of Global Optimization, 66:3, (383-415), Online publication date: 1-Nov-2016.
- Barni M and Tondi B (2016). Source Distinguishability Under Distortion-Limited Attack: An Optimal Transport Perspective, IEEE Transactions on Information Forensics and Security, 11:10, (2145-2159), Online publication date: 1-Oct-2016.
- Schmitzer B (2016). A Sparse Multiscale Algorithm for Dense Optimal Transport, Journal of Mathematical Imaging and Vision, 56:2, (238-259), Online publication date: 1-Oct-2016.
- Zhang L, Ren S, Wu C and Li Z (2016). A Truthful Incentive Mechanism for Emergency Demand Response in Geo-Distributed Colocation Data Centers, ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 1:4, (1-23), Online publication date: 21-Sep-2016.
- Johnson A, Burden S and Koditschek D (2016). A hybrid systems model for simple manipulation and self-manipulation systems, International Journal of Robotics Research, 35:11, (1354-1392), Online publication date: 1-Sep-2016.
- Strelow D, Wang Q, Si L and Eriksson A (2016). General, Nested, and Constrained Wiberg Minimization, IEEE Transactions on Pattern Analysis and Machine Intelligence, 38:9, (1803-1815), Online publication date: 1-Sep-2016.
- Fukuda E and Fukushima M (2016). The Use of Squared Slack Variables in Nonlinear Second-Order Cone Programming, Journal of Optimization Theory and Applications, 170:2, (394-418), Online publication date: 1-Aug-2016.
- Harwood S, Höffner K and Barton P (2016). Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded, Numerische Mathematik, 133:4, (623-653), Online publication date: 1-Aug-2016.
- Przybylek M, Wierzbicki A and Michalewicz Z Multi-hard Problems in Uncertain Environment Proceedings of the Genetic and Evolutionary Computation Conference 2016, (381-388)
- Sinha A, Tassiulas L and Modiano E Throughput-optimal broadcast in wireless networks with dynamic topology Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, (21-30)
- Reiman M, Wan H and Wang Q (2016). On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times, Operations Research Letters, 44:4, (436-442), Online publication date: 1-Jul-2016.
- Tarplee K, Friese R, Maciejewski A, Siegel H and Chong E (2016). Energy and Makespan Tradeoffs in Heterogeneous Computing Systems using Efficient Linear Programming Techniques, IEEE Transactions on Parallel and Distributed Systems, 27:6, (1633-1646), Online publication date: 1-Jun-2016.
- Zhang C, Bucarey V, Mukhopadhyay A, Sinha A, Qian Y, Vorobeychik Y and Tambe M Using Abstractions to Solve Opportunistic Crime Security Games at Scale Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, (196-204)
- Guo Q, An B, Vorobeychik Y, Tran-Thanh L, Gan J and Miao C Coalitional Security Games Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, (159-167)
- (2016). Analyzing process flexibility, Operations Research Letters, 44:3, (291-296), Online publication date: 1-May-2016.
- Poularakis K, Iosifidis G, Sourlas V and Tassiulas L (2016). Exploiting Caching and Multicast for 5G Wireless Networks, IEEE Transactions on Wireless Communications, 15:4, (2995-3007), Online publication date: 1-Apr-2016.
- Ferrer Fioriti L, Hashemi V, Hermanns H and Turrini A (2016). Deciding probabilistic automata weak bisimulation: theory and practice, Formal Aspects of Computing, 28:1, (109-143), Online publication date: 1-Mar-2016.
- Gao L and Zhou S Group and graph joint sparsity for linked data classification Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (1568-1574)
- Höffner K, Khan K and Barton P (2016). Generalized derivatives of dynamic systems with a linear program embedded, Automatica (Journal of IFAC), 63:C, (198-208), Online publication date: 1-Jan-2016.
- Hemachandra N and Sahu P A Geometric Viewpoint of the Selection of the Regularization Parameter in Some Support Vector Machines Proceedings of the Third International Conference on Mining Intelligence and Knowledge Exploration - Volume 9468, (140-149)
- Even G and Halabi N (2015). Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming, IEEE Transactions on Information Theory, 61:10, (5295-5305), Online publication date: 1-Oct-2015.
- Yunan Gu , Yanru Zhang , Miao Pan and Zhu Han (2015). Matching and Cheating in Device to Device Communications Underlying Cellular Networks, IEEE Journal on Selected Areas in Communications, 33:10, (2156-2166), Online publication date: 1-Oct-2015.
- Binnan Zhuang , Dongning Guo and Honig M (2015). Traffic-Driven Spectrum Allocation in Heterogeneous Networks, IEEE Journal on Selected Areas in Communications, 33:10, (2027-2038), Online publication date: 1-Oct-2015.
- Chatzidiamantis N, Georgiadis L, Sandalidis H and Karagiannidis G (2015). Throughput-Optimal Link-Layer Design in Power Constrained Hybrid OW/RF Systems, IEEE Journal on Selected Areas in Communications, 33:9, (1972-1984), Online publication date: 1-Sep-2015.
- Park S and Shin J Max-product belief propagation for linear programming Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, (662-671)
- Ya-Feng Liu , Yu-Hong Dai and Shiqian Ma (2015). Joint Power and Admission Control: Non-Convex
$L_{q}$ - Zhao W, Cheng Y and Rusu F Vertical partitioning for query processing over raw data Proceedings of the 27th International Conference on Scientific and Statistical Database Management, (1-12)
- Lübbecke M and Witt J Separation of Generic Cutting Planes in Branch-and-Price Using a Basis Proceedings of the 14th International Symposium on Experimental Algorithms - Volume 9125, (110-121)
- Ahn N and Park S (2015). An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks, Wireless Networks, 21:3, (783-792), Online publication date: 1-Apr-2015.
- Dasarathy G, Shah P, Bhaskar B and Nowak R (2015). Sketching Sparse Matrices, Covariances, and Graphs via Tensor Products, IEEE Transactions on Information Theory, 61:3, (1373-1388), Online publication date: 1-Mar-2015.
- Quaeghebeur E (2015). Characterizing coherence, correcting incoherence, International Journal of Approximate Reasoning, 56:PB, (208-223), Online publication date: 1-Jan-2015.
- Lim E and Luo Y On a least absolute deviations estimator of a multivariate convex function Proceedings of the 2014 Winter Simulation Conference, (2682-2691)
- Tanaskovic M, Fagiano L and Morari M (2014). On the optimal worst-case experiment design for constrained linear systems, Automatica (Journal of IFAC), 50:12, (3291-3298), Online publication date: 1-Dec-2014.
- Tanaskovic M, Fagiano L, Smith R and Morari M (2014). Adaptive receding horizon control for constrained MIMO systems, Automatica (Journal of IFAC), 50:12, (3019-3029), Online publication date: 1-Dec-2014.
- Karrenbauer A and Oulasvirta A Improvements to keyboard optimization with integer programming Proceedings of the 27th annual ACM symposium on User interface software and technology, (621-626)
- Qadir J, Baig A, Ali A and Shafi Q (2014). Multicasting in cognitive radio networks, Journal of Network and Computer Applications, 45:C, (44-61), Online publication date: 1-Oct-2014.
- Loscri V, Natalizio E, Guerriero F and Mitton N Efficient coverage for grid-based mobile wireless sensor networks Proceedings of the 11th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks, (53-60)
- Wu J, Wang W, Liang Q, Wu X and Zhang B (2014). Compressive sensing-based signal compression and recovery in UWB wireless communication system, Wireless Communications & Mobile Computing, 14:13, (1266-1275), Online publication date: 1-Sep-2014.
- Cheng Y, Cao X, Shen X, Shila D and Li H A systematic study of the delayed column generation method for optimizing wireless networks Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing, (23-32)
- Roijers D, Scharpff J, Spaan M, Oliehoek F, Weerdt M and Whiteson S Bounded approximations for linear multi-objective planning under uncertainty Proceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling, (262-270)
- Khadilkar H, Ganu T, Charbiwala Z, Ming L, Mathew S and Seetharam D Algorithms for upgrading the resolution of aggregate energy meter data Proceedings of the 5th international conference on Future energy systems, (277-288)
- Tarplee K, Maciejewski A and Siegel H Energy-aware profit maximizing scheduling algorithm for heterogeneous computing systems Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, (595-603)
- Roijers D, Whiteson S and Oliehoek F Linear support for multi-objective coordination graphs Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (1297-1304)
- Pajic M, Weimer J, Bezzo N, Tabuada P, Sokolsky O, Lee I and Pappas G Robustness of Attack-Resilient State Estimators ICCPS '14: ACM/IEEE 5th International Conference on Cyber-Physical Systems (with CPS Week 2014), (163-174)
- Hansen T, Kaplan H and Zwick U Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (847-860)
- Guzzo A, Moccia L, Saccà D and Serra E (2013). Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs, ACM Transactions on Knowledge Discovery from Data, 7:4, (1-39), Online publication date: 1-Nov-2013.
- Esposito F, Matta I and Ishakian V (2013). Slice embedding solutions for distributed service architectures, ACM Computing Surveys, 46:1, (1-29), Online publication date: 1-Oct-2013.
- Glavelis T, Ploskas N and Samaras N Combining interior and exterior simplex type algorithms Proceedings of the 17th Panhellenic Conference on Informatics, (174-179)
- Cozman F and di Ianni L Probabilistic satisfiability and coherence checking through integer programming Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, (145-156)
- Khan K and Barton P (2013). Evaluating an element of the Clarke generalized Jacobian of a composite piecewise differentiable function, ACM Transactions on Mathematical Software, 39:4, (1-28), Online publication date: 1-Jul-2013.
- Hausmans J, Wiggers M, Geuns S and Bekooij M Dataflow analysis for multiprocessor systems with non-starvation-free schedulers Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, (13-22)
- Li C (2013). On contextual ranking queries in databases, Information Systems, 38:4, (509-523), Online publication date: 1-Jun-2013.
- Letchford J and Vorobeychik Y Optimal interdiction of attack plans Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, (199-206)
- Guo Z, Wang B and Cui J (2013). Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks, Ad Hoc Networks, 11:3, (1136-1149), Online publication date: 1-May-2013.
- Rios J (2013). Algorithm 928, ACM Transactions on Mathematical Software, 39:3, (1-10), Online publication date: 1-Apr-2013.
- Morrison D, Sauppe J and Jacobson S (2013). A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network, INFORMS Journal on Computing, 25:1, (2-12), Online publication date: 1-Jan-2013.
- Hernandez A, Lucas T and Carlyle M (2012). Constructing nearly orthogonal latin hypercubes for any nonsaturated run-variable combination, ACM Transactions on Modeling and Computer Simulation, 22:4, (1-17), Online publication date: 1-Nov-2012.
- Whiting E, Shin H, Wang R, Ochsendorf J and Durand F (2012). Structural optimization of 3D masonry buildings, ACM Transactions on Graphics, 31:6, (1-11), Online publication date: 1-Nov-2012.
- Gebler D, Hashemi V and Turrini A Computing Behavioral Relations for Probabilistic Concurrent Systems Advanced Lectures of the International Autumn School on Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems - Volume 8453, (117-155)
- Batra D An efficient message-passing algorithm for the M-Best MAP problem Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, (121-130)
- Chakrabarty D and Huang Z Testing coverage functions Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I, (170-181)
- Secomandi N and Wang M (2012). A Computational Approach to the Real Option Management of Network Contracts for Natural Gas Pipeline Transport Capacity, Manufacturing & Service Operations Management, 14:3, (441-454), Online publication date: 1-Jul-2012.
- Lai J and Parkes D Monotone branch-and-bound search for restricted combinatorial auctions Proceedings of the 13th ACM Conference on Electronic Commerce, (705-722)
- Kriener J and King A Mutual exclusion by interpolation Proceedings of the 11th international conference on Functional and Logic Programming, (182-196)
- Jasin S and Kumar S (2012). A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice, Mathematics of Operations Research, 37:2, (313-345), Online publication date: 1-May-2012.
- Zhang Z, Wang Z, Gu X and Chakrabarty K (2012). Physical-defect modeling and optimization for fault-insertion test, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 20:4, (723-736), Online publication date: 1-Apr-2012.
- Gamarnik D, Shah D and Wei Y (2012). Belief Propagation for Min-Cost Network Flow, Operations Research, 60:2, (410-428), Online publication date: 1-Mar-2012.
- Andreotti S, Klau G and Reinert K (2012). Antilope—A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:2, (385-394), Online publication date: 1-Mar-2012.
- Tekin S, Andradóttir S and Down D (2012). Dynamic server allocation for unstable queueing networks with flexible servers, Queueing Systems: Theory and Applications, 70:1, (45-79), Online publication date: 1-Jan-2012.
- Blanchet J, Li J and Nakayama M A conditional Monte Carlo method for estimating the failure probability of a distribution network with random demands Proceedings of the Winter Simulation Conference, (3837-3848)
- Cao H, Hu J, Jiang C, Kumar T, Li T, Liu Y, Lu Y, Mahatma S, Mojsilović A, Sharma M, Squillante M and Yu Y (2011). OnTheMark, Interfaces, 41:5, (414-435), Online publication date: 1-Sep-2011.
- Guo X and Ishikawa Y Multi-objective optimal combination queries Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I, (47-61)
- Okamoto S, Paruchuri P, Wang Y, Sycara K, Marecki J and Srivatsa M Multiagent Communication Security in Adversarial Settings Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02, (296-303)
- Candogan O, Menache I, Ozdaglar A and Parrilo P (2011). Flows and Decompositions of Games, Mathematics of Operations Research, 36:3, (474-503), Online publication date: 1-Aug-2011.
- Oh E and Kim K A geometric traversal algorithm for reward-uncertain MDPs Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, (565-572)
- Hansen K, Koucky M, Lauritzen N, Miltersen P and Tsigaridas E Exact algorithms for solving stochastic games Proceedings of the forty-third annual ACM symposium on Theory of computing, (205-214)
- Jain M, Kiekintveld C and Tambe M Quality-bounded solutions for finite Bayesian Stackelberg games The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (997-1004)
- Kikuti D, Cozman F and Filho R (2011). Sequential decision making with partially ordered preferences, Artificial Intelligence, 175:7-8, (1346-1365), Online publication date: 1-May-2011.
- Pantelidou A and Ephremides A (2011). Scheduling in Wireless Networks, Foundations and Trends® in Networking, 4:4, (421-511), Online publication date: 1-Apr-2011.
- Mehrotra S and Li Z (2011). Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Journal of Global Optimization, 49:4, (623-649), Online publication date: 1-Apr-2011.
- Nowozin S and Lampert C (2011). Structured Learning and Prediction in Computer Vision, Foundations and Trends® in Computer Graphics and Vision, 6:3–4, (185-365), Online publication date: 1-Mar-2011.
- De Sterck H, Miller K and Sanders G (2011). Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method, Computing and Visualization in Science, 14:2, (51-65), Online publication date: 1-Feb-2011.
- Bertsimas D, Farias V and Trichakis N (2011). The Price of Fairness, Operations Research, 59:1, (17-31), Online publication date: 1-Jan-2011.
- Wiggers M, Bekooij M and Smit G (2011). Buffer capacity computation for throughput-constrained modal task graphs, ACM Transactions on Embedded Computing Systems, 10:2, (1-59), Online publication date: 1-Dec-2010.
- Kasbekar G and Sarkar S (2010). Spectrum auction framework for access allocation in cognitive radio networks, IEEE/ACM Transactions on Networking, 18:6, (1841-1854), Online publication date: 1-Dec-2010.
- Liu H, Qu W, Liu B and Chen J (2010). On the decomposition method for linear programming decoding of LDPC codes, IEEE Transactions on Communications, 58:12, (3448-3458), Online publication date: 1-Dec-2010.
- Chen Z, Chakrabarty K and Xiang D MVP Proceedings of the International Conference on Computer-Aided Design, (149-154)
- Iqbal R and Shirmohammadi S An analytical approach to model adaptive video streaming and delivery Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking, (55-58)
- Catrina O and De Hoogh S Secure multiparty linear programming using fixed-point arithmetic Proceedings of the 15th European conference on Research in computer security, (134-150)
- Kappes J, Schmidt S and Schnörr C MRF inference by k-fan decomposition and tight Lagrangian relaxation Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III, (735-747)
- Nanongkai D, Sarma A, Lall A, Lipton R and Xu J (2010). Regret-minimizing representative databases, Proceedings of the VLDB Endowment, 3:1-2, (1114-1124), Online publication date: 1-Sep-2010.
- Wu J, Liang Q and Zhou Z Compressive sensing for autoregressive hidden Markov model signal Proceedings of the 5th international conference on Wireless algorithms, systems, and applications, (360-363)
- Kalpakis K (2010). Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks, ACM Transactions on Sensor Networks, 7:1, (1-26), Online publication date: 1-Aug-2010.
- Ghate A, Sharma D and Smith R (2010). A Shadow Simplex Method for Infinite Linear Programs, Operations Research, 58:4-Part-1, (865-877), Online publication date: 1-Jul-2010.
- Holopainen V, Kantola R, Taira T and Lamminen O Automatic link numbering and source routed multicast Proceedings of the Mechanisms for autonomous management of networks and services, and 4th international conference on Autonomous infrastructure, management and security, (123-134)
- Dey T, Hirani A and Krishnamoorthy B Optimal homologous cycles, total unimodularity, and linear programming Proceedings of the forty-second ACM symposium on Theory of computing, (221-230)
- Yildiz M and Scaglione A (2010). Computing along routes via gossiping, IEEE Transactions on Signal Processing, 58:6, (3313-3327), Online publication date: 1-Jun-2010.
- Baghban Karimi O, Liu J and Li Z Multicast in multi-channel wireless mesh networks Proceedings of the 9th IFIP TC 6 international conference on Networking, (148-159)
- Rusmevichientong P and Tsitsiklis J (2010). Linearly Parameterized Bandits, Mathematics of Operations Research, 35:2, (395-411), Online publication date: 1-May-2010.
- Puchinger J, Raidl G and Pferschy U (2010). The Multidimensional Knapsack Problem, INFORMS Journal on Computing, 22:2, (250-265), Online publication date: 1-Apr-2010.
- Hu J, Lu Y, Mojsilović A, Sharma M and Squillante M (2010). Performance management of IT services delivery, ACM SIGMETRICS Performance Evaluation Review, 37:4, (50-57), Online publication date: 27-Mar-2010.
- Zhou H, Cheng Q and She Z Reparameterization based consistent graph-structured linear programs Proceedings of the 2010 ACM Symposium on Applied Computing, (974-978)
- Wang M, Xu L and Ramamurthy B Linear programming models for multi-channel P2P streaming systems Proceedings of the 29th conference on Information communications, (276-280)
- Ravikumar P, Agarwal A and Wainwright M (2010). Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes, The Journal of Machine Learning Research, 11, (1043-1080), Online publication date: 1-Mar-2010.
- Fu L, Liew S and Huang J (2010). Fast algorithms for joint power control and scheduling in wireless networks, IEEE Transactions on Wireless Communications, 9:3, (1186-1197), Online publication date: 1-Mar-2010.
- Baran T, Wei D and Oppenheim A (2010). Linear programming algorithms for sparse filter design, IEEE Transactions on Signal Processing, 58:3, (1605-1617), Online publication date: 1-Mar-2010.
- Chandru V and Rao M Linear programming Algorithms and theory of computation handbook, (30-30)
- Fleischer L Data center scheduling, generalized flows, and submodularity Proceedings of the Meeting on Algorithm Engineering & Expermiments, (56-65)
- Yue R, Xiao J, Wang S and Joseph S Modeling and path planning of the City-Climber robot part II Proceedings of the 2009 international conference on Robotics and biomimetics, (2391-2396)
- Whiting E, Ochsendorf J and Durand F Procedural modeling of structurally-sound masonry buildings ACM SIGGRAPH Asia 2009 papers, (1-9)
- özdemir D, Yücesan E and Herer Y Sample average approximation approach to multi-location transshipment problem with capacitated production Winter Simulation Conference, (2384-2394)
- Whiting E, Ochsendorf J and Durand F (2009). Procedural modeling of structurally-sound masonry buildings, ACM Transactions on Graphics, 28:5, (1-9), Online publication date: 1-Dec-2009.
- Yang K, Prasad N and Wang X (2009). An auction approach to resource allocation in uplink OFDMA systems, IEEE Transactions on Signal Processing, 57:11, (4482-4496), Online publication date: 1-Nov-2009.
- Peleg D and Meir R (2009). A sparsity driven kernel machine based on minimizing a generalization error bound, Pattern Recognition, 42:11, (2607-2614), Online publication date: 1-Nov-2009.
- Dimakis A, Gohari A and Wainwright M (2009). Guessing facets, IEEE Transactions on Information Theory, 55:8, (3479-3487), Online publication date: 1-Aug-2009.
- Halvorson E, Conitzer V and Parr R Multi-step multi-sensor hider-seeker games Proceedings of the 21st International Joint Conference on Artificial Intelligence, (159-166)
- Wu X, Falkenstern P, Chakrabarty K and Xie Y (2009). Scan-chain design and optimization for three-dimensional integrated circuits, ACM Journal on Emerging Technologies in Computing Systems, 5:2, (1-26), Online publication date: 1-Jul-2009.
- Wang W, Ong L and Motani M Transmission schedule optimization for half-duplex multiple-relay networks Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (1-9)
- Xiong S, Li J and Yu L Maximize the lifetime of a data-gathering wireless sensor network Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks, (306-314)
- Nowozin S and Jegelka S Solution stability in linear programming relaxations Proceedings of the 26th Annual International Conference on Machine Learning, (769-776)
- Yang Y, Blum R and Sadler B (2009). Energy-efficient routing for signal detection in wireless sensor networks, IEEE Transactions on Signal Processing, 57:6, (2050-2063), Online publication date: 1-Jun-2009.
- Sivaramakrishnan K and Weissman T (2009). A context quantization approach to universal denoising, IEEE Transactions on Signal Processing, 57:6, (2110-2129), Online publication date: 1-Jun-2009.
- Yang H, Huang K, King I and Lyu M (2009). Localized support vector regression for time series prediction, Neurocomputing, 72:10-12, (2659-2669), Online publication date: 1-Jun-2009.
- Ghosh A, Roughgarden T and Sundararajan M Universally utility-maximizing privacy mechanisms Proceedings of the forty-first annual ACM symposium on Theory of computing, (351-360)
- Kasbekar G and Sarkar S Spectrum auction framework for access allocation in cognitive radio networks Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, (13-22)
- Bowring E, Yin Z, Zinkov R and Tambe M Sensitivity analysis for distributed optimization with resource constraints Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, (633-640)
- Decker T (2009). Symmetric measurements attaining the accessible information, IEEE Transactions on Information Theory, 55:5, (2375-2383), Online publication date: 1-May-2009.
- Avella P and Boccia M (2009). A cutting plane algorithm for the capacitated facility location problem, Computational Optimization and Applications, 43:1, (39-65), Online publication date: 1-May-2009.
- Kiese M, Hartmann C, Lamberty J and Vilzmann R (2009). On connectivity limits in ad hoc networks with beamforming antennas, EURASIP Journal on Wireless Communications and Networking, 2009, (1-1), Online publication date: 1-Feb-2009.
- Saengudomlert P Optical switching in WDM networks Proceedings of the 23rd international conference on Information Networking, (542-588)
- Mitsos A, Lemonidis P and Barton P (2008). Global solution of bilevel programs with a nonconvex inner program, Journal of Global Optimization, 42:4, (475-513), Online publication date: 1-Dec-2008.
- Stein N, Ozdaglar A and Parrilo P (2008). Separable and low-rank continuous games, International Journal of Game Theory, 37:4, (475-504), Online publication date: 1-Dec-2008.
- Sredojević R and Stojanović V Optimization-based framework for simultaneous circuit-and-system design-space exploration Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, (314-321)
- Gill P, Shi L, Mahanti A, Li Z and Eager D (2008). Scalable on-demand media streaming for heterogeneous clients, ACM Transactions on Multimedia Computing, Communications, and Applications, 5:1, (1-24), Online publication date: 1-Oct-2008.
- Ravikumar P, Agarwal A and Wainwright M Message-passing for graph-structured linear programs Proceedings of the 25th international conference on Machine learning, (800-807)
- Ahmad I and Majumdar S Performance of resource management algorithms for "Processable Bulk Data Transfer" Tasks in Grid Environments Proceedings of the 7th international workshop on Software and performance, (177-188)
- Chen M, Ponec M, Sengupta S, Li J and Chou P (2008). Utility maximization in peer-to-peer systems, ACM SIGMETRICS Performance Evaluation Review, 36:1, (169-180), Online publication date: 12-Jun-2008.
- Casale G, Mi N and Smirni E (2008). Bound analysis of closed queueing networks with workload burstiness, ACM SIGMETRICS Performance Evaluation Review, 36:1, (13-24), Online publication date: 12-Jun-2008.
- Chen M, Ponec M, Sengupta S, Li J and Chou P Utility maximization in peer-to-peer systems Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (169-180)
- Casale G, Mi N and Smirni E Bound analysis of closed queueing networks with workload burstiness Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (13-24)
- Yang J (2008). Infeasibility resolution based on goal programming, Computers and Operations Research, 35:5, (1483-1493), Online publication date: 1-May-2008.
- Feige U, Immorlica N, Mirrokni V and Nazerzadeh H A combinatorial allocation mechanism with penalties for banner advertising Proceedings of the 17th international conference on World Wide Web, (169-178)
- Hildrum K, Douglis F, Wolf J, Yu P, Fleischer L and Katta A (2008). Storage optimization for large-scale distributed stream-processing systems, ACM Transactions on Storage, 3:4, (1-28), Online publication date: 1-Feb-2008.
- Huston S, Puchinger J and Stuckey P The core concept for 0/1 integer programming Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77, (39-47)
- Wainwright M and Jordan M (2008). Graphical Models, Exponential Families, and Variational Inference, Foundations and Trends® in Machine Learning, 1:1-2, (1-305), Online publication date: 1-Jan-2008.
- Crema A, Loreto M and Raydan M (2007). Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Computers and Operations Research, 34:10, (3174-3186), Online publication date: 1-Oct-2007.
- Dodo A, Davidson R, Xu N and Nozick L (2007). Application of regional earthquake mitigation optimization, Computers and Operations Research, 34:8, (2478-2494), Online publication date: 1-Aug-2007.
- Mohammadi A and Akl S Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks Proceedings of the 2007 Summer Computer Simulation Conference, (481-488)
- Bhattacharya S, Bhattacharyya C and Chandra N Structural alignment based kernels for protein structure classification Proceedings of the 24th international conference on Machine learning, (73-80)
- Bhadra S, Lu Y and Squillante M (2007). Optimal capacity planning in stochastic loss networks with time-varying workloads, ACM SIGMETRICS Performance Evaluation Review, 35:1, (227-238), Online publication date: 12-Jun-2007.
- Bhadra S, Lu Y and Squillante M Optimal capacity planning in stochastic loss networks with time-varying workloads Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (227-238)
- Lin G and Rajaraman R Approximation algorithms for multiprocessor scheduling under uncertainty Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, (25-34)
- Wiggers M, Bekooij M and Smit G Efficient computation of buffer capacities for cyclo-static dataflow graphs Proceedings of the 44th annual Design Automation Conference, (658-663)
- Paruchuri P, Pearce J, Tambe M, Ordonez F and Kraus S An efficient heuristic approach for security against multiple adversaries Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-8)
- Bach F and Jordan M (2006). Learning Spectral Clustering, With Application To Speech Separation, The Journal of Machine Learning Research, 7, (1963-2001), Online publication date: 1-Dec-2006.
- Yanover C, Meltzer T and Weiss Y (2006). Linear Programming Relaxations and Belief Propagation -- An Empirical Study, The Journal of Machine Learning Research, 7, (1887-1907), Online publication date: 1-Dec-2006.
- Mundinger J, Weber R and Weiss G (2006). Analysis of peer-to-peer file dissemination, ACM SIGMETRICS Performance Evaluation Review, 34:3, (12-14), Online publication date: 1-Dec-2006.
- Lee D (2006). Some Compartmentalized Secure Task Assignment Models for Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, 17:12, (1414-1424), Online publication date: 1-Dec-2006.
- Dolgov D and Durfee E (2006). Resource allocation among agents with MDP-induced preferences, Journal of Artificial Intelligence Research, 27:1, (505-549), Online publication date: 1-Sep-2006.
- Kveton B, Hauskrecht M and Guestrin C (2006). Solving factored MDPs with hybrid state and action variables, Journal of Artificial Intelligence Research, 27:1, (153-201), Online publication date: 1-Sep-2006.
- Aghassi M, Bertsimas D and Perakis G (2006). Solving asymmetric variational inequalities via convex optimization, Operations Research Letters, 34:5, (481-490), Online publication date: 1-Sep-2006.
- DeVinney J and Priebe C (2006). A new family of proximity graphs, Discrete Applied Mathematics, 154:14, (1975-1982), Online publication date: 1-Sep-2006.
- Um J and Kim T (2006). Resource Sharing Combined with Layout Effects in High-Level Synthesis, Journal of VLSI Signal Processing Systems, 44:3, (231-243), Online publication date: 1-Sep-2006.
- Jones C and Maciejowski J Primal-dual enumeration for multiparametric linear programming Proceedings of the Second international conference on Mathematical Software, (248-259)
- Noronha T, Ribeiro C, Duran G, Souyris S and Weintraub A A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament Proceedings of the 6th international conference on Practice and theory of automated timetabling VI, (174-186)
- Meyers C and Orlin J Very large-scale neighborhood search techniques in timetabling problems Proceedings of the 6th international conference on Practice and theory of automated timetabling VI, (24-39)
- Pham M, Kim D, Kim T and Yoo S Maximize the coverage lifetime of sensor networks Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing, (475-484)
- Zohar A and Rosenschein J Mechanisms for partial information elicitation Proceedings of the 21st national conference on Artificial intelligence - Volume 1, (734-739)
- Hamed H and Al-Shaer E (2006). On autonomic optimization of firewall policy organization, Journal of High Speed Networks, 15:3, (209-227), Online publication date: 1-Jul-2006.
- Ravikumar P and Lafferty J Quadratic programming relaxations for metric labeling and Markov random field MAP estimation Proceedings of the 23rd international conference on Machine learning, (737-744)
- Tseng C, Chiang W, Hsu W, Lin S, Tsai C, Chen C and Hung D Optimum arrangement between natural disasters insurance and risk control Proceedings of the 17th IASTED international conference on Modelling and simulation, (184-187)
- Puchinger J, Raidl G and Pferschy U The core concept for the multidimensional knapsack problem Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization, (195-208)
- Hamed H and Al-Shaer E Dynamic rule-ordering optimization for high-speed firewall filtering Proceedings of the 2006 ACM Symposium on Information, computer and communications security, (332-342)
- Kulkarni G, Adlakha S and Srivastava M (2005). Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks, IEEE Transactions on Mobile Computing, 4:6, (652-662), Online publication date: 1-Nov-2005.
- Lu Q, George B and Shekhar S Capacity constrained routing algorithms for evacuation planning Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases, (291-307)
- Kameshwaran S, Benyoucef L and Xie X Discount auctions for procuring heterogeneous items Proceedings of the 7th international conference on Electronic commerce, (244-249)
- Kveton B and Hauskrecht M An MCMC approach to solving hybrid factored MDPs Proceedings of the 19th international joint conference on Artificial intelligence, (1346-1351)
- Lahaie S, Constantin F and Parkes D More on the power of demand queries in combinatorial auctions Proceedings of the 19th international joint conference on Artificial intelligence, (959-964)
- Sou K, Megretski A and Daniel L A quasi-convex optimization approach to parameterized model order reduction Proceedings of the 42nd annual Design Automation Conference, (933-938)
- Parkes D, Cavallo R, Elprin N, Juda A, Lahaie S, Lubin B, Michael L, Shneidman J and Sultan H ICE Proceedings of the 6th ACM conference on Electronic commerce, (249-258)
- Tarello A, Sun J, Zafer M and Modiano E Minimum Energy Transmission Scheduling Subject to Deadline Constraints Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (67-76)
- Chen K, Chen H, Borie R and Liu J File replication in video on demand services Proceedings of the 43rd annual Southeast regional conference - Volume 1, (162-167)
- Roozbehani M, Feron E and Megrestki A Modeling, optimization and computation for software verification Proceedings of the 8th international conference on Hybrid Systems: computation and control, (606-622)
- Bruni R (2005). On Exact Selection of Minimally Unsatisfiable Subformulae, Annals of Mathematics and Artificial Intelligence, 43:1-4, (35-50), Online publication date: 1-Jan-2005.
- Taskar B, Chatalbashev V and Koller D Learning associative Markov networks Proceedings of the twenty-first international conference on Machine learning
- Bramson M and Williams R (2003). Two Workload Properties for Brownian Networks, Queueing Systems: Theory and Applications, 45:3, (191-221), Online publication date: 1-Nov-2003.
- Zhang L, Coenen F and Leng P (2003). Setting attribute weights for k-NN based binary classification via quadratic programming, Intelligent Data Analysis, 7:5, (427-441), Online publication date: 1-Oct-2003.
- Park S, Raghunathan V and Srivastava M Energy efficiency and fairness tradeoffs in multi-resource, multi-tasking embedded systems Proceedings of the 2003 international symposium on Low power electronics and design, (469-474)
- Berezin S, Ganesh V and Dill D An online proof-producing decision procedure for mixed-integer linear arithmetic Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (521-536)
- Engelke S and Kanzow C (2002). Predictor-Corrector Smoothing Methods for Linear Programs with a More Flexible Update of the Smoothing Parameter, Computational Optimization and Applications, 23:3, (299-320), Online publication date: 1-Dec-2002.
- Bertsimas D and Vempala S Solving convex programs by random walks Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (109-115)
- Harrison J and López M (1999). Heavy traffic resource pooling in parallel-server systems, Queueing Systems: Theory and Applications, 33:4, (339-368), Online publication date: 14-Apr-1999.
- Watterson M, Smith T and Kumar V Smooth trajectory generation on SE(3) for a free flying space robot 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (5459-5466)
- Liang Q and Modiano E Survivability in time-varying networks IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
- Liu L, Cao X, Shen W, Cheng Y and Cai L DAFEE: A Decomposed Approach for energy efficient networking in multi-radio multi-channel wireless networks IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
- Kingston Z, Dantam N and Kavraki L Kinematically constrained workspace control via linear optimization 2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids), (758-764)
- Hao Z, Sun Y, Li Q and Zhang Y Delay - Energy Efficient Computation Offloading and Resources Allocation in Heterogeneous Network 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
- Sadraddini S and Belta C Robust temporal logic model predictive control 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), (772-779)
Recommendations
A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation
The reactive power optimization is an effective method to improve voltage level, decrease network losses and maintain the power system running under normal conditions. This paper provides a method combining particle swarm optimization (PSO) with linear ...
Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
Distributed Algorithms in Science and EngineeringIn this paper, we focus on solving non-linear programming (NLP) problems using quantum-behaved particle swarm optimization (QPSO). After a brief introduction to the original particle swarm optimization (PSO), we describe the origin and development of ...
On the HSS iteration methods for positive definite Toeplitz linear systems
We study the HSS iteration method for large sparse non-Hermitian positive definite Toeplitz linear systems, which first appears in Bai, Golub and Ng's paper published in 2003 [Z.-Z. Bai, G.H. Golub, M.K. Ng, Hermitian and skew-Hermitian splitting ...