scientific article; zbMATH DE number 193499
From MaRDI portal
Publication:4040299
local searchgreedymatroidstime complexityworst-case analysisBenders' decompositioncomputabilityheuristic procedurespartial enumerationcutting methodsexact and nonexact algorithmsLagrangian dual ideasnonpolynomial algorithmstime-polynomial algorithmstruncated exponential algorithms
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Integer programming (90C10) Mixed integer programming (90C11) Combinatorial aspects of matroids and geometric lattices (05B35) Discrete mathematics in relation to computer science (68Rxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited in
(89)- A graph approximation heuristic for the vertex cover problem on planar graphs
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A multi-period network design problem for cellular telecommunication systems
- scientific article; zbMATH DE number 4014440 (Why is no real title available?)
- An extension to the single bottleneck transportation problem
- New algorithms for pattern matching with wildcards and length constraints
- scientific article; zbMATH DE number 432992 (Why is no real title available?)
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Generalized surrogate problem methodology for online stochastic discrete optimization
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Revival of the Gomory cuts in the 1990's
- Discrete optimization: a quantum revolution?
- Linear programs for constraint satisfaction problems
- The multiple bottleneck transportation problem
- An LP-based algorithm for the data association problem in multitarget tracking.
- Scatter search and star-paths: Beyond the genetic metaphor
- scientific article; zbMATH DE number 5238864 (Why is no real title available?)
- Mathematical programming approach to the Petri nets reachability problem
- Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- A direct heuristic algorithm for linear programming
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Unlocking Your Bike the Easy Way
- Minimizing the weighted number of tardy jobs on parallel processors
- Integer solutions via goal programming to hierarchical systems.
- Exploiting process plan flexibility in production scheduling: A multi-objective approach
- Algorithms for solving a separable problem of discrete optimization
- Optimal harvesting and optimal vaccination
- Timetable planning using the constraint-based reasoning
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Integer programming models for the q-mode problem
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- A facility location model for logistics systems including reverse flows: the case of remanufacturing activities
- Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- scientific article; zbMATH DE number 4093169 (Why is no real title available?)
- Online surrogate problem methodology for stochastic discrete resource allocation problem.
- An adaptation of SH heuristic to the location set covering problem
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- A discrete dynamic convexized method for nonlinear integer programming
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- Lagrangean/surrogate relaxation for generalized assignment problems
- Integer programs for logic constraint satisfaction
- Minimizing the weighted number of tardy jobs on a single machine
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Global optimization by multilevel search
- Nonlinear discrete optimization. An algorithmic theory
- Gomory cuts revisited
- Disjunctive optimization: Critical point theory
- Nonlinear nonconvex optimization by evolutionary algorithms applied to robust control
- Lower bound functions for polynomials
- A column generation approach for the maximal covering location problem
- Relaxation heuristics for a generalized assignment problem
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- MANPAK: A set of algorithms for computations on implicitly defined manifolds
- Discrete optimization under interval uncertainty
- Scheduling for stability in single-machine production systems
- An exact algorithm for cost minimization in series reliability systems with multiple component choices
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- A heuristic approach to simultaneous course/student timetabling
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy
- Parallelizing simulated annealing algorithms based on high-performance computer
- Paroids: A canonical format for combinatorial optimization
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Discrete optimization in the industrial computer science
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling
- OPTi's Algorithm for Discreteness Determination
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Optimization of discrete systems
- An intelligent algorithm for mixed-integer programming models
- A binary integer linear program with multi-criteria and multi-constraint levels
- Zero duality gap in surrogate constraint optimization: a concise review of models
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems
- Another pedagogy for pure-integer Gomory
- Implementation of an integer optimization platform using object oriented programming
- Strong duality in optimization: shifted power reformulation
- A Lagrangian heuristic for capacitated single item lot sizing problems
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- General purpose heuristics for integer programming. I
- Decomposition and dynamic cut generation in integer linear programming
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
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 Q4040299)
