scientific article; zbMATH DE number 1416629

MaRDI QIDQ4943600zbMATH OpenFDO

Authors G. L. Nemhauser, Laurence A. Wolsey

Publication date 19 March 2000

Cited in

(only showing first 100 items - show all)

Complementary column generation and bounding approaches for set partitioning formulations
Block-diagonal semidefinite programming hierarchies for 0/1 programming
Global solution of bilevel programs with a nonconvex inner program
On column generation formulations for the RWA problem
An improved partial enumeration algorithm for integer programming problems
On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
Optimization of order policies in supply networks
Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
Polytopes related to the \(l_{\infty}\)-distance between vectors
A technique for speeding up the solution of the Lagrangean dual
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
Frequency assignment in mobile radio systems using branch-and-cut techniques
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
Mathematical models for on-line train calendars generation
The p-arborescence star problem: formulations and exact solution approaches
Computational approaches for zero forcing and related problems
Branch-and-cut for linear programs with overlapping SOS1 constraints
Ambiguous risk constraints with moment and unimodality information
A strengthened mixed-integer linear programming formulation for combined-cycle units
Liner shipping service scheduling and cargo allocation
An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
Integer programming approach to static monopolies in graphs
Multi-period stochastic covering location problems: modeling framework and solution approach
Robust multicovers with budgeted uncertainty
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
A Lagrangian approach for minimum cost single round robin tournaments
Network design formulations for scheduling U.S. air force channel route missions
Chvatal--Gomory--tier cuts for general integer programs
Benders decomposition: solving binary master problems by enumeration
A Lagrangean-based heuristics for the target covering problem in wireless sensor network
New product launch decisions with robust optimization
Optimization algorithms for the disjunctively constrained knapsack problem
The biobjective travelling purchaser problem
Undecidability of restricted uniform recurrence equations
Application of a hybrid genetic algorithm to airline crew scheduling
Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
Improved algorithms for optimal length resolution refutation in difference constraint systems
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
Analysis of a generalized linear ordering problem via integer programming
An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
Polyhedral properties of the induced cluster subgraphs
Air traffic flow management with layered workload constraints
The multiple shortest path problem with path deconfliction
The generalized minimum branch vertices problem: properties and polyhedral analysis
A solution framework for linear PDE-constrained mixed-integer problems
Analyzing unit read-once refutations in difference constraint systems
On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
The Lagrangian, constraint qualifications and economics
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Exact approaches for the minimum subgraph diameter problem
On the exact separation of cover inequalities of maximum-depth
Substitution-based equipment balancing in service networks with multiple equipment types
Stochastic Lipschitz dynamic programming
Set covering problem with conflict constraints
An elastic demand model for locating electric vehicle charging stations
A logic-based Benders decomposition for microscopic railway timetable planning
Efficient computation of the Shapley value for large-scale linear production games
The sociotechnical teams formation problem: a mathematical optimization approach
Binary signed-graphic matroids: representations and recognition algorithms
Information coverage maximization for multiple products in social networks
The minimum chromatic violation problem: a polyhedral approach
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
Combinatorial \(n\)-fold integer programming and applications
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
Dynamic pricing of flexible time slots for attended home delivery
Leveraged least trimmed absolute deviations
Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
Convex hull representation of the deterministic bipartite network interdiction problem
Spectral compressive sensing
A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
A Davidson college multi-objective assignment problem: a case study
On tree-constrained matchings and generalizations
Cyclic and non-cyclic crew rostering problems in public bus transit
On the chance-constrained minimum spanning \(k\)-core problem
Retrieving a contingency table from a correspondence analysis solution
A polyhedral study of dynamic monopolies
Approximation schemes for \(r\)-weighted minimization knapsack problems
Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
D-optimal design for network A/B testing
Parallel execution of schedules with random dependency graph
Exact computation of censored least absolute deviations estimator
Hierarchical solution of non-convex optimal control problems with application to autonomous driving
Graph coloring inequalities from all-different systems
Revealed preference tests for weak separability: an integer programming approach
Cutting to the chase.
Handling least privilege problem and role mining in RBAC
A column generation mathematical programming approach for a class-faculty assignment problem with preferences
Probability chains: a general linearization technique for modeling reliability in facility location and related problems
New insights on integer-programming models for the kidney exchange problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943600)