Keyword

linear programming relaxation

Description: An optimization technique that approximates a discrete or constrained problem by replacing selected constraints with a linear programming formulation.

Primary topic: Complexity and Algorithms in Graphs (27%)

Wikidata ID: wiki/Q1512771

OpenAlex ID: keywords/linear-programming-relaxation

An analysis of approximations for maximizing submodular set functions—I

1978 · G. L. Nemhauser, L. A. Wolsey, et al. · Mathematical Programming · 4,402

Branch-and-Price: Column Generation for Solving Huge Integer Programs

1998 · Cynthia Barnhart, Ellis L. Johnson, et al. · Operations Research · 2,219

The Lagrangian Relaxation Method for Solving Integer Programming Problems

1981 · Marshall L. Fisher · Management Science · 2,113

An Automatic Method of Solving Discrete Programming Problems

1960 · A. H. Land, A. G. Doig · Econometrica · 1,943

Graphical Models, Exponential Families, and Variational Inference

2008 · Martin J. Wainwright, Michael I. Jordan · Foundations and Trends® in Machine Learning · 1,823

The Traveling-Salesman Problem and Minimum Spanning Trees

1970 · Michael Held, Richard M. Karp · Operations Research · 1,441

A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows

1992 · Martin Desrochers, Jacques Desrosiers, et al. · Operations Research · 1,199

Approximation algorithms for scheduling unrelated parallel machines

1990 · Jan Karel Lenstra, David B. Shmoys, et al. · Mathematical Programming · 939

Offloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling

2017 · Thinh Quang Thinh, Jianhua Tang, et al. · IEEE Transactions on Communications · 866

Virtual Network Embedding with Coordinated Node and Link Mapping

2009 · N. M. M. K. Chowdhury, M. R. Rahman, et al. · IEEE Conference on Computer Communications (INFOCOM) · 829

ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping

2011 · Mosharaf Chowdhury, Muntasir Raihan Rahman, et al. · IEEE/ACM Transactions on Networking · 819

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

1981 · T. L. Magnanti, R. T. Wong · Operations Research · 732

A lift-and-project cutting plane algorithm for mixed 0–1 programs

1993 · Egon Balas, Sebastián Ceria, et al. · Mathematical Programming · 720

Vertex packings: Structural properties and algorithms

1975 · G. L. Nemhauser, L. E. Trotter · Mathematical Programming · 664

2002 · Moses S. Charikar · 659

MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming

2005 · M.J. Wainwright, T.S. Jaakkola, et al. · IEEE Transactions on Information Theory · 654

On Steiner trees and minimum spanning trees in hypergraphs

2002 · Tobias Polzin, Siavash Vahdati Daneshmand · Operations Research Letters · 623

An analysis of approximations for maximizing submodular set functions—II

1978 · M. L. Fisher, G. L. Nemhauser, et al. · Mathematical programming studies · 587

Using Linear Programming to Decode Binary Linear Codes

2005 · J. Feldman, M.J. Wainwright, et al. · IEEE Transactions on Information Theory · 572

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

2004 · Mohit Tawarmalani, Nikolaos V. Sahinidis · Mathematical Programming · 568

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

1988 · Prabhakar Raghavan · Journal of Computer and System Sciences · 544

PDF

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

2001 · Kamal Jain · COMBINATORICA · 540

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

2011 · Roberto Baldacci, Aristide Mingozzi, et al. · Operations Research · 506

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

1997 · Leslie A. Hall, Andreas S. Schulz, et al. · Mathematics of Operations Research · 488

An efficient approximation scheme for the one-dimensional bin-packing problem

1982 · Narendra Karmarkar, Richard M. Karp · Annual Symposium on Foundations of Computer Science · 481

Works count: 7,367

Citation count: 154,200