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)

Combinatorial optimization. Theory and algorithms.
On a biobjective search problem in a line: formulations and algorithms
Combining metaheuristics with mathematical programming, constraint programming and machine learning
A theoretical and computational analysis of full strong-branching
Spatio-temporal pricing for ridesharing platforms
Optimization methods: an applications-oriented primer
How to Secure Matchings Against Edge Failures
Feasibility on using carbon credits: a multiobjective model
Estimation of \(l_0\) norm penalized models: a statistical treatment
On a posterior evaluation of a simple greedy method for set packing
An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
Exact algorithms for inventory constrained scheduling on a single machine
A cross entropy algorithm for the Knapsack problem with setups
How to Secure Matchings against Edge Failures
Fast algorithms for the undirected negative cost cycle detection problem
The sociotechnical teams formation problem: a mathematical optimization approach
Collaborative emergency berth scheduling based on decentralized decision and price mechanism
Algorithmic analysis of priority-based bin packing
On the copy complexity of width 3 Horn constraint systems
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Faster algorithms for next breakpoint and max value for parametric global minimum cuts
Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
An exact method for a discrete multiobjective linear fractional optimization
Integer linear programming models for topology optimization in sheet metal design
Air traffic flow management with layered workload constraints
A unified pre-training and adaptation framework for combinatorial optimization on graphs
The bus rapid transit investment problem
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
Exact computation of censored least absolute deviations estimator
Hierarchical solution of non-convex optimal control problems with application to autonomous driving
Adaptive solution prediction for combinatorial optimization
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
School choice with controlled choice constraints: hard bounds versus soft bounds
On the exact separation of cover inequalities of maximum-depth
Substitution-based equipment balancing in service networks with multiple equipment types
Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
A Review for Submodular Optimization on Machine Scheduling Problems
Knapsack polytopes: a survey
Fair Policy Targeting
Polytopes related to the \(l_{\infty}\)-distance between vectors
Immersed NURBS for CFD applications
Expressive markets for donating to charities
Global solution of bilevel programs with a nonconvex inner program
Revealed preference tests for weak separability: an integer programming approach
Analysis of a generalized linear ordering problem via integer programming
Information-theoretic approaches to branching in search
Node-based valid inequalities for the optimal transmission switching problem
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
A genetic algorithm applied to optimal allocation in stratified sampling
EXPLOITING OPTIMAL CONTROL FOR TARGET-ORIENTED MANIPULATION OF (BIO)CHEMICAL SYSTEMS: A MODEL-BASED APPROACH TO SPECIFIC MODIFICATION OF SELF-ORGANIZED DYNAMICS
A Benders decomposition algorithm for base station planning problem in WCDMA networks
Order selection in nonlinear time series models with application to the study of cell memory
Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
Polynomial time analysis of toroidal periodic graphs
Deceptive Reinforcement Learning Under Adversarial Manipulations on Cost Signals
Undecidability of restricted uniform recurrence equations
Integer set reduction for stochastic mixed-integer programming
Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
Mathematical models for on-line train calendars generation
Local testing of lattices
Management of resource sharing in emergency response using data-driven analytics
Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
A branch-and-price approach for harvest scheduling subject to maximum area restrictions
The value function of an infinite-horizon single-item lot-sizing problem
Monoidal cut strengthening revisited
Multi-period stochastic covering location problems: modeling framework and solution approach
A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems
Robust multicovers with budgeted uncertainty
Stochastic robustness metric and its use for static resource allocations
Ambiguous risk constraints with moment and unimodality information
Branch-and-bound solves random binary IPs in poly\((n)\)-time
Leveraged least trimmed absolute deviations
Combining metaheuristics with mathematical programming, constraint programming and machine learning
On approximating optimal weight ``no-certificates in weighted difference constraint systems
Spectral compressive sensing
Stochastic Lipschitz dynamic programming
Efficient enumeration of the optimal solutions to the correlation clustering problem
Binary linear programming approach to graph convex covering problems
A column generation mathematical programming approach for a class-faculty assignment problem with preferences
Optimal length resolution refutations of difference constraint systems
A computational study of a cutting plane algorithm for university course timetabling
scientific article; zbMATH DE number 7626767 (Why is no real title available?)
Convex hull representation of the deterministic bipartite network interdiction problem
Polyhedral properties of the induced cluster subgraphs
Optimal experimental design: formulations and computations
Second-order cover inequalities
A Lagrangian approach for minimum cost single round robin tournaments
Frequency assignment in mobile radio systems using branch-and-cut techniques
Evaluating mixed-integer programming models over multiple right-hand sides
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
Multicriteria energy policy investments and energy market clearance via integer programming
Two-stage stochastic mixed-integer programs: algorithms and insights
A graph-based decomposition method for convex quadratic optimization with indicators
Computing assortative mixing by degree with the s-metric in networks using linear programming
Minimum k‐cores and the k‐core polytope
Separation, dimension, and facet algorithms for node flow polyhedra
Behavioral analytics for myopic agents
Continuum approximation techniques for the design of integrated package distribution systems

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)