The following pages link to Hadi Charkhgard (Q298164):
Displaying 34 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
- Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage (Q1652674) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
- Bi-objective autonomous vehicle repositioning problem with travel time uncertainty (Q2026711) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- A two-stage approach for bi-objective integer linear programming (Q2417052) (← links)
- Query batching optimization in database systems (Q2664311) (← links)
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
- Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming'' (Q2669770) (← links)
- Efficient algorithms for travelling salesman problems arising in warehouse order picking (Q2788859) (← links)
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method (Q2802241) (← links)
- A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)
- A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING (Q3122035) (← links)
- THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! (Q5038207) (← links)
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
- The Triangle Splitting Method for Biobjective Mixed Integer Programming (Q5418993) (← links)
- Solving multiplicative programs by binary-encoding the multiplication operation (Q6047881) (← links)
- OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming (Q6067899) (← links)
- A robust biobjective optimization approach for operating a shared energy storage under price uncertainty (Q6071087) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
- Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles (Q6071125) (← links)
- An iterative combinatorial auction design for fractional ownership of autonomous vehicles (Q6071126) (← links)
- A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse (Q6745280) (← links)
- Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks (Q6764439) (← links)
