tingyingwu2010 Goto Github PK

irace-rand1bin

Differential Evolutionary algorithm optimization by iterated racing

item-recovery-problem-alns

ALNS-based optimization technique for the "Item Recovery Problem", which is an optimization problem where an AUV with a maximum carry weight must visit multiple sites and recover items (i.e. bring them to a "base site") of different weights.

iterated_local_search_-_random_variable_neighborhood_descent

Metaheuristic Iterated Local Search to solve Vehicle Routing Problem with Simultaneous Delivery and Pickup using Variable Neighborhood Descent.

j-horizon

(Update-15-MAY-2020) A Vehicle Routing Problem Software. CVRP (Capacitated VRP), MDVRP (Multiple Depot VRP), VRPTW (VRP with Time Windows), VRPB (VRP with Backhauls), VRPPD (VRP with Pickups and Deliveries), VRP with Homogeneous or Heterogeneous Fleet, TSP, mTSP and various combination of these types

java

27天成为Java大神

javapractice

java a beginner's guide sixth edition herbet schildt

jensen

A C++ toolkit for Convex Optimization (Logistic Loss, SVM, SVR, Least Squares etc.), Convex Optimization algorithms (LBFGS, TRON, SGD, AdsGrad, CG, Nesterov etc.) and Classifiers/Regressors (Logistic Regression, SVMs, Least Squares Regression etc.)

jgrapht

Master repository for the JGraphT project

jmarkov

Java framework for Markov-chain (MC) modelling

jorlib

Java Operations Research Library

jscipopt

Java interface for the SCIP Optimization Suite

jumper.jl

Julia for Mathematical Programming - extension for Robust Optimization

jumptutorials.jl

Tutorials on using JuMP for mathematical optimization in Julia

junit5

✅ The 5th major version of the programmer-friendly testing framework for Java and the JVM

l-solver

Generic implementation of decomposition methods in Optimization

lago

LaGO (Lagrangian Global Optimizer) is a software-package for the global optimization of nonconvex mixed-integer nonlinear programs (MINLP).

lagrangean-relaxation

lagrangian-relaxation-algorithm-for-rrslrp

To solve the RRS-LRP problem based on resource-space-time network, we developed a Lagrangian Relaxation Algorithm framework to decompose the origin problem into classic knapsack sub-problem and vehicle routing problem with recharging station (VRP-RS). The knapsack problem is solved by dynamic programming algorithm and a dynamic programming algorithm in RST network is developed to solve the VRP-RS. The dual problem of adjusting the Lagrangian multipliers was solved by an ascent method using sub-gradients approach. The algorithm framework is naturally suitable for parallel computing and distributed computing techniques due to the decomposition structure.

latex-tutorial

The LaTeX Tutorial of the Fachschaft WIAI

lb-lis

A note on “An exact algorithm for the blocks relocation problem with new lower bounds”

learingcplexlist1

Learning CPLEX using C++ API

learngit

learning-acopf

A project for implementing the work done in the paper "Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow"

lihang

Statistical learning methods, 统计学习方法(第2版)[李航] [笔记, 代码, notebook, 参考文献, Errata, lihang]

lkh-sp

llamafile

Distribute and run LLMs with a single file.

location-transportation-problem

Robust optimization, Decision rule, Benders Docomposition

logos

Discrete optimization models (i.e., stochastic optimization, distributionally robust optimization and conditional value-at-risk optimization) that can be employed for capital budgeting optimization problems

lrco

Learning for Robust Combinatorial Optimization: Algorithm and Application

machine-learning

讲解常见的机器学习算法