A general purpose exact solution method for mixed integer concave minimization problems
From MaRDI portal
Publication:6112823
DOI10.1016/j.ejor.2023.02.005arXiv2208.09253OpenAlexW4319661813MaRDI QIDQ6112823
Guneshwar Anand, Ankur Sinha, Sachin Jayaswal, Arka Das
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.09253
global optimizationconcave minimizationknapsack problemmixed integer non-linear programmingproduction-transportation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local search in d.c. optimization problems
- Tabu search and lower bounds for a combined production-transportation problem
- A branch and search algorithm for a class of nonlinear knapsack problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Exact algorithm for concave knapsack problems: linear underestimation and partition method
- Exact solution of a class of nonlinear knapsack problems
- Incorporating inventory and routing costs in strategic location models
- The quadratic knapsack problem -- a survey
- Constrained global optimization: algorithms and applications
- A note on multi-item inventory systems with limited capacity
- An algorithm for the min concave cost flow problem
- An algorithm for the solution of the 0-1 knapsack problem
- Solving certain singly constrained convex optimization problems in production planning
- Global search algorithms for minimum concave-cost network flow problems
- Quasi-concave minimization subject to linear constraints
- Lagrangean methods for the 0-1 quadratic knapsack problem
- An extended formulation approach to the edge-weighted maximal clique problem
- A production-transportation problem with stochastic demand and concave production costs
- Handbook of test problems in local and global optimization
- A cutting-plane approach to the edge-weighted maximal clique problem
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- Min-cut clustering
- Optimization on low rank nonconvex structures
- A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- A pseudo-polynomial algorithm for solving rank three concave production-transportation problems
- Nonlinear integer programming for optimal allocation in stratified sampling
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- A branch-and-reduce approach to global optimization
- Solving the production transportation problem via a deterministic annealing neural network method
- On the solution of concave knapsack problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Constrained multi-item inventory systems: An implicit approach
- Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs
- A cut-and-branch algorithm for the quadratic knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- An algorithm for concave integer minimization over a polyhedron
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- Heuristic solutions for general concave minimum cost network flow problems
- A finite algorithm for concave minimization over a polyhedron
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- Quadratic knapsack problems
- Global Maximization of a Convex Function with Linear Inequality Constraints
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- A hybrid approach to discrete mathematical programming
- An algorithm and new penalties for concave integer minimization over a polyhedron
- Optimal Facility Location with Concave Costs
- Exact Solution of the Quadratic Knapsack Problem
- Online Knapsack Problem Under Concave Functions
- Concave minimization over a convex polyhedron
- The Nonlinear Resource Allocation Problem
- A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions
- A new exact algorithm for concave knapsack problems with integer variables
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
- A polynomial time solvable concave network flow problem
- An Algorithm for Separable Nonconvex Programming Problems
- A Decomposition Algorithm for Solving the Multifacility Production-Transportation Problem with Nonlinear Production Costs
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- Benchmarking optimization software with performance profiles.
This page was built for publication: A general purpose exact solution method for mixed integer concave minimization problems